Shuffling Large Decks of Cards and the Bernoulli–Laplace Urn Model
- 56 Downloads
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: How can a human (as opposed to a computer) shuffle a large deck of cards? The procedure we study is to break the deck into several reasonably sized piles, shuffle each thoroughly, recombine the piles, perform a simple deterministic operation, for instance a cut, and repeat. This process can also be seen as a generalised Bernoulli–Laplace urn model. We use coupling arguments and spherical function theory to derive upper and lower bounds on the mixing times of these Markov chains.
KeywordsBernoulli–Laplace urn model Shuffling large decks Mixing times Path coupling Spherical functions Dual Hahn polynomials Gelfand pairs
Mathematics Subject Classification (2010)60C05 60J10
We would like to thank Persi Diaconis for suggesting this problem, as well as for many helpful discussions and comments.
- 2.Bernoulli, D.: Disquisitiones analyticae de novo problemate coniecturali. Novi Commentarii Acad. Petrop XIV, 3–25 (1769)Google Scholar
- 3.Bubley, R., Dyer, M., Jt, L.L.: Path coupling: a technique for proving rapid mixing in markov chains. In: FOCS \(^\prime \)97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), p. 223 (1997)Google Scholar
- 14.Markov, A.: Rasprostranenie zakona bol’shih chisel na velichiny, zavisyaschie drug ot druga. Izvestiya Fiziko-matematicheskogo obschestva pri Kazanskom universitete, 2-ya seriya 15(3), 135–156 (1906)Google Scholar
- 15.Pulskamp, R.: Daniel I Bernoulli. http://cerebro.xu.edu/math/Sources/DanBernoulli/index.htm. Accessed Jan 2015
- 16.Pulskamp, R.: Notes to accompany disquisitiones analyticae de novo problemate coniecturali. http://cerebro.xu.edu/math/Sources/DanBernoulli/notes%20to%20de%20novo%20problemate.pdf. Accessed Jan 2015
- 17.Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, STOC ’93, pp. 672–681. ACM, New York (1993). https://doi.org/10.1145/167088.167260
- 18.Stanton, D.: Orthogonal polynomials and Chevalley groups. In: Askey, R.A., Koornwinder, T.H., Schempp, W.J. (eds.) Special Functions: Group Theoretical Aspects and Applications. Mathematics and its Applications, pp. 87–128. Reidel, Dordrecht (1984).Google Scholar
- 19.Todhunter, I.: History of the Mathematical Theory of Probability from the Time of Pascal to that of Laplace. New critical idiom. Macmillan and Company (1865). https://books.google.com/books?id=lBoPAAAAIAAJ
- 20.White, G.: Combinatorial methods in Markov chain mixing. PhD Thesis, Stanford University (2017)Google Scholar