How many shuffles to randomize a deck of cards?

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 456, Issue 2002, 2000, Pages 2561-2568

  Trefethen, L N ^a   Trefethen, L M ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Tufts University   (United States)

Author keywords

Cut off phenomenon; Eigenvalues; Entropy; Information; Markov chain; Shuffling

Indexed keywords

EID: 0000425083     PISSN: 13645021     EISSN: None     Source Type: Journal    
DOI: 10.1098/rspa.2000.0625     Document Type: Article

References (28)

1. Aldous, D. 1983 Random, walk on finite groups and rapidly mixing Markov chains. Springer Lecture Notes in Mathematics, vol. 986, pp. 243-297. Springer.
2. Aldous, D. & Diaconis, P. 1986 Shuffling cards and stopping times. Am. Math. Monthly 93, 333-348.
3. Barron, A. R. 1986 Entropy and the central limit theorem. Ann. Prob. 14, 336-342.
4. Bayer, D. & Diaconis, P. 1992 Trailing the dovetail shuffle to its lair. Ann. Appl. Prob. 2, 294-313.
5. Bingham, N. H. 1991 Fluctuation theory for the Ehrenfest urn. Adv. Appl. Prob. 23, 598-611.
6. Cover, T. M. & Thomas, J. A. 1991 Elements of information theory. Wiley.
7. Diaconis, P. 1988 Group representations in probability and statistics. Hayward, CA: IMS.
8. Diaconis, P. 1996 The cutoff phenomenon in finite Markov chains. Proc. Natn. Acad. Sei. USA 93, 1659-1664.
9. Diaconis, P. & Graham, R. 1992 An affine walk on the hypercube. J. Corap. Appl. Math. 41, 215-235.
10. Diaconis, P., McGrath, M. & Pitman, J. W. 1995 Riffle shuffles, cycles and descents. Combinatorial 15, 11-29.
11. Diaconis, P. & Stroock, D. 1991 Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob, l, 11-29.
12. Feller, W. 1968 An introduction to probability theory and its applications, vol. 1, 3rd edn. Wiley.
13. Fill, J. A. 1991 Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an appplication to the exclusion process. Ann. Appl. Prob, l, 62-87.
14. Gilbert, E. 1955 Theory of shuffling. Technical memorandum, Bell Laboratories. Jönsson, G. F. & Trefethen, L. N. 1998 A numerical analyst looks at the 'cutoff phenomenon' in card shuffling and other Markov chains. In Numerical analysis (cd. D. F. Griffiths, D. J. Higham & G. A. Watson), pp. 150-178. Addison-Wesley.
15. Kac, M. 1959 Probability and related topics in the physical sciences. London: Interscience.
16. Kolata, G. 1990 In shuffling cards, 7 is winning number. New York Times, p. 1, 9 January 1990.
17. Kuliback, S. 1959 Information theory and statistics. Wiley.
18. Lovâsz, L. & Winkler, P. 1995 Mixing of random walks and other diffusions on a graph. In Surveys in combinatorics (ed. P. Rowlinson). London Mathematical Society Lecture Notes, vol. 218, pp. 119-154. Cambridge University Press.
19. Martin-Lof, A. 1983 Statistical mechanics and the foundations of thermodynamics. Springer Lecture Notes in Physics, vol. 101. Springer.
20. Meyn, S. P. & Tweedie, R. L. 1993 Markov chains and stochastic stability. Springer.
21. Norris, J. R. 1997 Markov chains. Cambridge University Press.
22. Rényi, A. 1970 Probability theory. Amsterdam: North-Holland.
23. Shannon, C. E. &: Weaver, W. 1949 The mathematical theory of communication. Urbana, IL: University of Illinois Press.
24. Stark, D., Ganesh, A. & O'Connell, N. 1999 Information loss in card-shuffling. Technical report HPL-BRIMS-9905, BRIMS, Hewlett-Packard Labs, Bristol, UK.
25. Stewart, G. W. 1997 On Markov chains with sluggish transients. Commun. Stat. Stochastic Models 13, 35-95.
26. Su, F. E. 1995 Methods for quantifying rates of convergence for random walks on groups. PhD thesis, Harvard University.
27. Trefethen, L. N. & Bau III, D. 1997 Numerical linear algebra. Philadelphia, PA: SIAM.
28. Trefethen, L. N., Trefethen, A. E., Reddy, S. C. & Driscoll, T. A. 1993 Hydrodynamic stability without eigenvalues. Science 261, 578-584.