Abstract | ||
---|---|---|
The Thorp shuffle is defined as follows. Cut a deck of cards into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip, then drop from the other pile. Continue this way until both piles are empty. We show that the mixing time for the Thorp shuffle with $2^d$ cards is polynomial in $d$. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1137/050636231 | SIAM J. Comput. |
Keywords | Field | DocType |
thorp shuffle,fair coin,equal pile,right pile,left pile,mixing time,card shuffling | Standard 52-card deck,Discrete mathematics,Pile,Fair coin,Combinatorics,Polynomial,Shuffling,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 2 | 0097-5397 |
ISBN | Citations | PageRank |
1-58113-960-8 | 10 | 1.54 |
References | Authors | |
1 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ben Morris | 1 | 127 | 8.78 |