A rule of thumb for riffle shuffling
Authors:
- Sami AssafSASami Assaf
- Persi DiaconisPDPersi Diaconis
- K. SoundararajanKSK. Soundararajan
Open Access
- 1 June 2011
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 21 (3) , 843-875
Abstract
We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, for example, suits disregarded or only the colors of interest. For these features the number of shuffles drops from (3/2) log2 n to log2 n. We derive closed formulae and an asymptotic “rule of thumb” formula which is remarkably accurate.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Carries, Shuffling, and an Amazing MatrixThe American Mathematical Monthly, 2009
- The cutoff phenomenon for randomized riffle shufflesRandom Structures & Algorithms, 2007
- Riffle shuffles of decks with repeated cardsThe Annals of Probability, 2006
- On Choosing and Bounding Probability MetricsInternational Statistical Review, 2002
- No-feedback card guessing for dovetail shufflesThe Annals of Applied Probability, 1998
- Carries, Combinatorics, and an Amazing MatrixThe American Mathematical Monthly, 1997
- Riffle shuffles, cycles, and descentsCombinatorica, 1995
- Shuffling Cards and Stopping TimesThe American Mathematical Monthly, 1986
- Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and EigenvectorsThe American Mathematical Monthly, 1985
- Random walks on finite groups and rapidly mixing markov chains1983