Shuffling Large Decks of Cards and the Bernoulli–Laplace Urn Model

Evita Nestoridi, Graham White

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)417-446
Number of pages30
JournalJournal of Theoretical Probability
Volume32
Issue number1
DOIs
StatePublished - Mar 15 2019

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty

Keywords

  • Bernoulli–Laplace urn model
  • Dual Hahn polynomials
  • Gelfand pairs
  • Mixing times
  • Path coupling
  • Shuffling large decks
  • Spherical functions

Fingerprint Dive into the research topics of 'Shuffling Large Decks of Cards and the Bernoulli–Laplace Urn Model'. Together they form a unique fingerprint.

Cite this