The cutoff phenomenon is a sharp transition in the convergence of high-dimensional Markov chains to equilibrium: the total variation distance remains close to 1 for a long time and then rapidly decreases to almost 0 over a much shorter time window. It was initially discovered in the context of card shuffling by Diaconis and Shahshahani, and it has since then been observed in a variety of different models. In spite of its ubiquity, it is still largely unexplained, and most proofs are model-specific. In this talk, we discuss a general approach to establishing cutoff based on transport inequalities, and we illustrate it with a few examples. Based on joint work with Justin Salez.
Further Information
Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.