The ratio convention for cutoff for Markov chains requires for every fixed , with positive denominators eventually. Equivalently, any two fixed levels have asymptotically equal mixing times. This convention permits a bounded-time jump; definitions which additionally require diverging mixing times exclude such a jump. For nonlazy simple random walk on the complete graph , every fixed-level mixing time is eventually one.
For finite irreducible Markov chains that are aperiodic Markov chains and reversible Markov chains, the ratio definition of cutoff and imply the Peres product condition, with . If on a subsequence, then and the eigenvalue lower bound for total variation mixing give
For sufficiently small fixed , this contradicts the limit one forced by cutoff for Markov chains. The same argument proves the stronger conclusion .

Articles by others on the same topic (0)

There are currently no matching articles.