The power of averaging at two consecutive time steps: Proof of a mixing conjecture by Aldous and Fill
Jonathan Hermon, Yuval Peres

TL;DR
This paper proves that for reversible Markov chains, the cutoff phenomenon occurs simultaneously in both continuous-time and averaged versions, with the averaged chains having at most as wide a cutoff window, resolving a problem posed by Aldous and Fill.
Contribution
It establishes a precise quantitative relationship between the mixing times of continuous-time and averaged Markov chains, confirming their cutoff behaviors coincide.
Findings
Cutoff occurs simultaneously in continuous-time and averaged chains.
The cutoff window for averaged chains is at most that of continuous-time chains.
Provides an affirmative answer to a problem posed by Aldous and Fill.
Abstract
Let be an irreducible reversible discrete time Markov chain on a finite state space . Denote its transition matrix by . To avoid periodicity issues (and thus ensuring convergence to equilibrium) one often considers the continuous-time version of the chain whose kernel is given by . Another possibility is to consider the associated averaged chain , whose distribution at time is obtained by replacing by . A sequence of Markov chains is said to exhibit (total-variation) cutoff if the convergence to stationarity in total-variation distance is abrupt. Let be a sequence of irreducible reversible discrete time Markov chains. In this work we prove that the sequence of associated continuous-time…
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.
