1986/05/01 by David Aldous, Persi Diaconis · 4 citations
Computer Science · Mathematics · #Algorithms and Data Compression #Mathematics and Applications #Advanced Combinatorial Mathematics
paper · doi:10.2307/2323590
openalex publication_date 1986/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
1. Introduction. How many times must a deck of cards be shuffled until it is close to random? There is an elementary technique which often yields sharp estimates in such problems. The method is best understood through a simple example. EXAMPLE1. Top in at random shuffle. Consider the following method of mixing a deck of cards: the top card is removed and inserted into the deck at a random position. This procedure is