Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

Markov Chains and Mixing Times

Levin, Peres and Wilmer's Markov Chains and Mixing Times: coupling, spectral methods, and bounds on mixing.

13 completed missions

Missions

1–13 of 13
Open0Completed13All13
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times XI: The Cutoff Phenomenon and Lamplighter WalksTextbook

For many natural chains, convergence to stationarity is not gradual: the distance stays near its maximum for a long time and then collapses to zero in a comparatively negligible window. A deck of cards under riffle shuffles is "not at all mixed" for six shuffles and "essentially mixed" after eight. This abrupt transition is the cutoff phenomenon, discovered…

18 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times X: Martingales and Evolving SetsTextbook

Every mixing bound in Missions II–IX ultimately leaned on either coupling or the spectrum, and the spectral route demanded reversibility. Chapter 17 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) opens a third route: martingales — processes whose conditional expected increment vanishes — and the beautiful evolving-set process of Morris…

14 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times IX: The Ising ModelTextbook

The Ising model is statistical mechanics' fruit fly: spins ±1\pm1±1 on the vertices of a graph, neighbours preferring to agree, a single parameter — the inverse temperature β\betaβ — tuning the strength of that preference. Chapter 15 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) studies the Glauber dynamics for this model and exhibits, on…

17 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times V: Shuffling CardsTextbook

How many shuffles does a deck of cards need? The question created the modern theory of mixing times: Diaconis and Shahshahani's analysis of random transpositions (1981) and the Bayer–Diaconis "seven shuffles suffice" analysis of the riffle shuffle (1992) are its founding results. Chapters 8 and 16 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS,…

19 thms6 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times XII: Continuous Time and Countable State SpacesTextbook

The whole series so far lived in discrete time on finite state spaces. Chapters 20–21 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) lift both restrictions. Running the jumps of a chain at the arrivals of a rate-one Poisson clock produces the continuous-time chain, whose transition semigroup — the heat kernel — converges to stationarity…

17 thms5 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times VII: Eigenvalues and the Cheeger InequalityTextbook

How fast does a Markov chain forget its starting point? For a reversible chain the complete answer is coded in the eigenvalues of its transition matrix: the largest eigenvalue is always 111, and the size of the gap between 111 and the rest of the spectrum is the chain's fundamental time constant — a large gap means fast mixing, a small gap means slow mixing.…

24 thms5 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times IV: Lower Bounds on Mixing TimesTextbook

Missions II–III produce upper bounds on mixing times. Whether such a bound is sharp is a different question: an O(n2)O(n^2)O(n2) bound on a chain that actually mixes in nlog⁡nn\log nnlogn steps hides the truth. Chapter 7 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) develops the standard toolkit of lower bounds: the counting and diameter bounds (a chain…

12 thms5 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times III: Coupling and Strong Stationary TimesTextbook

The Convergence Theorem of Mission II says an irreducible aperiodic chain mixes geometrically, but with constants coming from a crude Doeblin decomposition — useless for actual chains, whose state spaces are exponentially large. Chapters 5–6 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) develop the two classic probabilistic techniques…

22 thms5 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times VIII: Path Coupling and Approximate CountingTextbook

The coupling method of Mission III asks for a coupling of two copies of a chain from every pair of starting states — often painful to construct globally. Chapter 14 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) replaces that global demand by a local one. The path coupling technique of Bubley and Dyer says: put a connected graph structure…

9 thms4 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times VI: Networks, Hitting Times, and Cover TimesTextbook

A reversible Markov chain is an electrical network: states are nodes, and the conductance c(x,y)=π(x)P(x,y)c(x,y)=\pi(x)P(x,y)c(x,y)=π(x)P(x,y) turns hitting probabilities into voltages and hitting times into resistances. This dictionary, going back to Kakutani and popularized by Doyle and Snell, converts probabilistic estimates into the physical laws of circuits — series/parallel…

15 thms4 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times I: Existence and Uniqueness of the Stationary DistributionTextbook

Finite Markov chains are the basic model for memoryless random dynamics: card shuffles, random walks on graphs and groups, Monte Carlo samplers, and queueing systems are all chains on a finite state space. The single most used fact about them is that an irreducible chain has exactly one stationary distribution — a probability vector π\piπ with π=πP\pi = \pi Pπ=πP —…

20 thms4 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times XIII: Coupling from the PastTextbook

Every sampling guarantee in this series so far is approximate: run the chain for tmix(ε)t_{\mathrm{mix}}(\varepsilon)tmix​(ε) steps and the output is within ε\varepsilonε of stationarity. In 1996 Propp and Wilson showed that, astonishingly, one can often sample exactly from the stationary distribution of a chain — with no error at all and no knowledge of the mixing time —…

5 thms2 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: Shuze Chen

Markov Chains and Mixing Times II: The Convergence TheoremTextbook

The first mission of this series established that an irreducible finite Markov chain has a unique stationary distribution π\piπ. The present mission, covering Chapters 3–4 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009), answers the two questions that make that fact useful. First, the inverse problem of sampling: given a target distribution …

14 thms2 active usersReviewed

Top contributors

RankContributorAccepted solutionsSubmitted problems
1ALallychan327680
2MKMKPynnic390
3CHchenmin273
4PUpunai230
5ANann160
6STsteven32
7NINickrobbins9510
7RYryanshin10
7SCShuze Chen1201

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me