The cutoff phenomenon for finite Markov Chains
A card player may ask the following question: how many shuffles are needed to mix up a deck of cards? Mathematically, this question falls in the realm of the quantitative study of the convergence of finite Markov chains. Similar convergence rate questions for finite Markov chains are important in many fields including statistical physics, computer science, biology and more. In this dissertation, we discuss a behavior ---the cutoff phenomenon--- that is known to appear in many models. For these models, after a waiting period, the chain abruptly converges to its stationary distribution. Our aim is to develop a theory of this phenomenon and to illustrate this theory with interesting examples. We focus on the case when the convergence is measured at the $\ell^p$-distance for $1\le p\le\infty$. For $p=1$, one recovers the classical total variation distance. One of the main result of the thesis is that for families of reversible Markov chains and $1<p\le\infty$, the existence of an $\ell^p$-cutoff can be characterized using two parameters: the spectral gap and the mixing time. This fails when $p=1$. The notion of cutoff for a family of Markov chains indexed by $n$ involves a cutoff time sequence $(t_n)_1^\infty$ and window size sequence $(b_n)_1^\infty$. Ideally, when a cutoff exists, we would like to determine precisely $t_n$ and $b_n$. When $p=2$, spectral theory allows for a deeper analysis of the cutoff phenomenon producing in some cases the asymptotic behavior of the sequences $(t_n)_1^\infty$ and $(b_n)_1^\infty$. Throughout the thesis, examples are provided to illustrate the theoretical results. In particular, the last chapter is devoted to the study of the cutoff for the randomized riffle shuffle.
Markov Chain; Cutoff phenomenon; Mixing time; Ergodicity; Markov semigroup
dissertation or thesis