Universality of Cutoff for Riffle Shuffling
Mark Sellke, Jialu Shi, Jiamin Wang

TL;DR
This paper proves the cutoff phenomenon for riffle shuffles with general pile size distributions, extending previous results limited to binomial cuts, and characterizes the mixing time in terms of the distribution's limit.
Contribution
It establishes cutoff for riffle shuffles with arbitrary pile size distributions, including deterministic sequences, and extends to multi-partite shuffles, generalizing prior binomial-based results.
Findings
Cutoff occurs at a time proportional to log N with an explicit constant.
The 'cold spot' phenomenon determines the mixing time in general.
Results apply to both random and deterministic pile size sequences.
Abstract
A Gilbert-Shannon-Reeds (GSR) shuffle is performed on a deck of cards by cutting the top cards and interleaving the two resulting piles uniformly at random. The celebrated "Seven shuffles suffice" theorem of [Bayer-Diaconis '92] established cutoff for this Markov chain: to leading order, total variation mixing occurs after precisely shuffles. Later work of [Lalley '00] and [Sellke '22] extended this result to asymmetric binomial cuts for all . These results relied heavily on the binomial condition and many natural chains were left open, including uniformly random cuts and exact bisections. We establish cutoff for riffle shuffles with general pile size distribution. Namely, suppose the cut sizes are IID and the convergence in distribution holds for some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
