American Mathematical Monthly · 1986 · 347 citations · 11 references
Natural SciencesMathematicsProbability TheoryStatisticsStochastic ProcessesMarkov ProcessesStatistical Analysis
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
11
Random Walk and the Theory of Brownian Motion
Mark Kac · American Mathematical Monthly · 1947 · 489 citations
Engineering, Mathematics, Physics +12
The mathematics of perfect shuffles
Persi Diaconis, Ron Graham, William M. Kantor · Advances in Applied Mathematics · 1983 · 107 citations
Minimization Algorithms and Random Walk on the $d$-Cube
David Aldous · The Annals of Probability · 1983 · 98 citations · Full text