Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Modern aspects of Markov chains: entropy, curvature and the cutoff phenomenon

T0 review · 3 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Varentropy says when Markov chains snap to equilibrium

desk verdict Careful, honest lecture notes that re-package the author's own recent cutoff theorems; the math is sound, but it's survey material with some unproven imports. read the letter →

arxiv 2508.21055 v1 pith:ESS5AKVW submitted 2025-08-28 math.PR

Justin Salez This is my paper
classification math.PR MSC 60J2760J1060B1560K35
keywords cutoffphenomenonvarentropymixingtimesBakry-Emerycurvatureinformation-theoreticdifferentialinequalityproductconditionrandomwalksongroupsMarkovchainMonteCarlo
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

These lecture notes defend a unified, model-independent answer to a long-standing question: when does a Markov chain exhibit a cutoff, an abrupt jump from un-mixed to mixed? The answer centers on a second-order statistic called varentropy, the variance of the log-likelihood under the chain's law. The notes prove a universal bound on the width of the mixing window in terms of the spectral gap and the square root of varentropy at the mixing time, upgrading the classical product condition from a necessary to a sufficient criterion. For chains and diffusions with non-negative curvature, they derive explicit, checkable rates from an information-theoretic differential inequality, yielding new cutoff criteria for random walks on groups and high-temperature spin systems.

What carries the argument

Varentropy: the variance of log f(X) when X is drawn from density f with respect to equilibrium. It measures how concentrated the chain's information content is, and via the reversed Pinsker inequality it controls how much entropy remains in the un-mixed regime. The other load-bearing tools are the information-theoretic differential inequality (IDI), a differential bound on varentropy in terms of entropy decay; the approximate chain rule, which controls the cost of the smooth chain rule on discrete spaces through the roughness r = Lip log f; and the Bakry-Émery curvature ρ ≥ 0, which supplies the local Poincaré inequality and sub-commutation bound used to derive the IDI.

What would settle it

Run a weakly reversible chain with non-negative Bakry-Émery curvature, bounded degree, and γ t_mix diverging; compute varentropy at the mixing time. If √V_ε grows at least as fast as γ t_mix, the universal bound no longer forces cutoff, disproving the claim that these curvature criteria are sufficient.

Watch

Extended reading notes

Core claim

The central claim is Theorem 5.1: for any Markov chain on a finite state space and any initial density f, the width of the mixing window between precisions 1-ε and ε is at most (2/(γ ε²))(1 + √V_{f,ε}), where γ is the spectral gap and V_{f,ε} is the varentropy at the mixing time. As a corollary, a model has cutoff whenever γ t_mix ≫ 1 + √V_ε. Section 5.5 upgrades this for weakly reversible chains with non-negative Bakry-Émery curvature: the varentropy satisfies an information-theoretic differential inequality with rate ψ(t)=16t log d + 4t log⁺(diam/t), giving worst-case cutoff as soon as γ t_mix ≫ log d or α t_mix ≫ log log d. For non-negatively curved diffusions the equivalence is exact: cu

Load-bearing premise

The proof of the curvature-to-cutoff criteria needs the log-density of the evolved chain to have Lipschitz constant O(log d + log(diam/t)) at the mixing time; if that roughness control fails, the information-theoretic differential inequality collapses to the plain product condition, which is known to be insufficient.

Editorial extensions

If this is right

  • Non-negatively curved chains with γ t_mix ≫ log d cut off; this verifies cutoff for random walks on Abelian groups with large spectral gap, and for high-temperature Ising and low-fugacity hard-core samplers.
  • Non-negatively curved diffusions cut off iff γ t_mix diverges, a complete characterization in that class.
  • The varentropy criterion applies from arbitrary initial densities, so cutoff is predicted not only worst-case but for every starting point satisfying the inequality.
  • Random Abelian Cayley graphs with d_n ≥ (1+δ) log₂|X_n| and log d_n ≪ (log |X_n|)^{1/3} exhibit cutoff in probability.
  • The product condition is upgraded: rather than γ t_mix → ∞ alone, one needs γ t_mix ≫ 1 + √V_ε, with varentropy the universal correction.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Outside the paper's claims, the same width bound suggests a route to cutoff for negatively curved chains: any control of varentropy growth would replace the product condition; expanders would follow if a curvature-independent varentropy estimate held.
  • The explicit IDI rate hints that cutoff windows are governed by the evolution of varentropy; one could numerically compute Varent(P_t^* f) for small models to predict the window width before a full analytic proof exists.
  • The Abelian Cayley result is conditional on an imported spectral-gap theorem; proving a deterministic version of Alon-Roichman for Abelian groups would make the cutoff statement fully deterministic and likely sharpen the log d bound.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. These lecture notes develop a general information-theoretic approach to the cutoff phenomenon. The central object is the varentropy of the density at the mixing time. Theorem 5.1 proves a universal bound on the width of the mixing window, wmix(f, ε) ≤ (2/(γε²))(1 + √V_{f,ε}), and Corollary 5.1 upgrades the classical product condition to a sufficient condition for cutoff. For weakly reversible chains with non-negative Bakry–Émery curvature, Theorem 5.3 establishes an information-theoretic differential inequality with rate ψ(t) = 16t log d + 4t log⁺(diam(X)/t), yielding cutoff criteria γ t_mix ≫ log d and α t_mix ≫ log log d. The notes also treat non-negatively curved diffusions (Theorem 5.2), random Abelian Cayley graphs (Corollary 5.3), and MCMC applications to Ising and hard-core models. Earlier chapters survey mixing times, functional inequalities, hypercontractivity, and curvature for Markov chains, with worked examples including the hypercube and the cycle.

Significance. If correct, the varentropy criterion is the first general, model-independent sufficient condition for cutoff, and the curvature-based criteria give checkable conditions for important classes of chains. The main proof chain is largely coherent: the varentropy width bound, the reversed Pinsker inequality, the low-entropy mixing lemma, the approximate chain rule, and the roughness estimates are internally consistent up to the local corrections noted below. The worked examples reproduce known constants (hypercube α = 4/n, random transpositions α = Θ(1/n) and t_mix = Θ(n log n)), which is a useful benchmark for the theory. The presentation is systematic and the explicit quantitative rates are a strength. The main caveats are concentrated in the proofs of two load-bearing lemmas and in the unproved assertions in the Ising/hard-core examples.

major comments (3)
  1. [§5.1, Lemma 5.2] The proof of Lemma 5.2 contains an algebraic gap. It derives ∥P*_t f̂ − 1∥₁ ≤ exp((1 + Ent(f))/ε − γt) and then says this is less than ε by choosing t = (1 + Ent(f))/(γε). Substitution gives exp(0) = 1, not ε. The subsequent triangle inequality then gives only ∥P*_t f − 1∥₁ ≤ 1 + ε, which is not enough for TV ≤ ε. This can be repaired by adding a log(1/ε) term and adjusting the constants in Theorem 5.1, but as written the proof of a central lemma is incomplete. Since Theorem 5.1 and Corollary 5.1 rely on this lemma, the proof needs correction.
  2. [§5.3, Lemma 5.3] In the proof of Lemma 5.3, the displayed bound ||T P_t f / P_t f||∞ ≤ e + (diam(X)/t) log⁺( d^{diam(X)}/t ) does not follow from the preceding one-path lower bound e^{-t}(t/(dℓ))^ℓ. The correct expression is log⁺( d · diam(X) / t ), not log⁺( d^{diam(X)} / t ). With the written expression, the subsequent estimate Lip log P_t f ≤ 3 log d + 2 log⁺(diam(X)/t) is not justified. The statement of the lemma appears to be true, and the issue is likely typographical, but the proof needs to be corrected because Lemma 5.3 supplies the roughness bound used in Theorem 5.3.
  3. [§5.5, Examples 5.4–5.5] The cutoff conclusions for the Ising and hard-core samplers rely on the assertion that under (5.9) and (5.10), respectively, “α is of the same order as in the basic case where π is uniform, and so are d and t_mix.” This is not established in the notes. Theorem 4.7 provides lower bounds on κ₁, hence on α, but not the two-sided control “same order,” and no reference is supplied for the asserted behavior of t_mix for these models. These examples therefore do not currently follow from the results developed in the paper. Either prove the assertions or replace them with explicit citations.
minor comments (4)
  1. [§1.1 and throughout] There are several typographical errors: “Cesar´o” should be “Cesàro,” “surprise” should be “surprise,” and a few equations have ambiguous spacing in fractions. These do not affect the mathematics.
  2. [§5.3, Lemma 5.3] The phrase “non-zero f” should probably be “non-negative, positive” depending on context; also the superscript in the display d^{diam(X)} should be corrected as described in the major comments.
  3. [§5.4, Theorem 5.2] The “if and only if” statement for compact diffusions is stated without explicitly citing the necessity direction to Lemma 1.2. Adding a sentence would help the reader verify the equivalence.
  4. [References] Several cited works are preprints ([52], [53], [54], [55], [104], [109], [110]) and some may have appeared in final form since the arXiv posting; updating the references would improve the notes.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; central varentropy/IDI derivation is self-contained.

full rationale

The core derivation chain is presented with proofs rather than citations. Theorem 5.1 is obtained from Lemma 5.1 (proved) and Lemma 5.2 (proved); Corollary 5.1 is a direct sufficient condition, not a fitted prediction. Theorem 5.2 and Theorem 5.3 derive their IDI rates from the approximate chain rule (Lemma 4.3) and the roughness estimate (Lemma 5.3), both proved in the text, together with curvature assumptions. No parameter is fitted to data and no target quantity is inserted into an input. The self-citations to [108,109,104] introduce the chapter's provenance, but the theorems are re-proved, so the self-citation is not load-bearing. External inputs (Alon-Roichman spectral gap for Corollary 5.3; Goel/Gao-Quastel MLSI constants for Examples 5.2-5.3) are independent support. Two non-circular weaknesses should be noted: Examples 5.4-5.5 assert without proof that α, d, and t_mix are 'of the same order' as the uniform case (Section 5.5), and Corollary 5.3 imports a spectral-gap theorem; these affect applications, not the central circularity status.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The paper introduces no free parameters fitted to data: all constants in Theorems 5.1-5.3 (e.g. psi(t) = 16t log d + 4t log^+(diam/t)) come from explicit proofs, and the model constants in the examples (alpha, gamma, t_mix, d) are imported from cited prior literature, not fitted here. The axioms are standard background (spectral theory, transport duality, diffusion chain rules) plus several external results that carry specific corollaries (random Cayley graph spectral gaps, MLSI constants for named models, and the asserted alpha comparison for Ising/hard-core samplers). No new entities (particles, forces, dimensions) are postulated; 'varentropy' and the 'IDI' are mathematical definitions presented as borrowed from [108, 109, 104].

assumptions (7)
  • domain assumption Finite irreducible transition matrices T, embedded in continuous time via mean-one exponential clocks (Poissonization), Assumption 1.1.
    Section 1.1, equation (1.1) and Assumption 1.1. This sets the entire object of study: all chains are finite, irreducible, continuous-time rate-one.
  • standard math Spectral theorem for reversible chains: orthonormal eigenbasis expansion (2.3), and spectral gap identity lambda = 1 - max Re(theta) over spec(T) minus 1 via Gelfand's formula.
    Sections 1.2 and 2.1, equations (1.9) and (2.2)-(2.3). Used in Lemma 2.1, Remark 2.2, Example 3.1 and throughout the functional inequality chapter.
  • standard math Kantorovich duality for the Wasserstein distance (4.2) and existence of optimal couplings on finite spaces.
    Section 4.1, used in the proof of Theorem 4.1 characterizing Ollivier-Ricci curvature, and in Lemma 4.2 for sectional curvature.
  • domain assumption Diffusion framework: the Langevin SDE (2.16) is well-posed under mild conditions on U, and the chain rule identities (2.19), (3.20) and (4.35) hold on weighted manifolds.
    Sections 2.5 and 5.4, used in Theorem 5.2 (cutoff for non-negatively curved diffusions) and Remark 5.1. The notes explicitly decline to prove these foundations, citing [8, 9].
  • domain assumption External spectral gap theorem for random Abelian Cayley graphs: for |S_n| >= (1+delta) log2 |X_n|, gamma(G_n) >= C_delta with high probability (Alon-Roichman, refined by Pak, Naor, Hermon-Olesker-Taylor).
    Section 5.2, cited to [5, 102, 94, 52]. This is a load-bearing input for Corollary 5.3; it is imported without proof.
  • domain assumption Imported quantitative estimates for model chains: hypercube alpha = 4/n; random transpositions alpha = Theta(1/n) and t_mix = Theta(n log n); conjugacy classes with k non-fixed points alpha = Theta(k/n) and t_mix = Theta(n log n / k); MLSI of order n^{-2} for the n-cycle.
    Examples 3.3-3.4 and 5.1-5.3, cited to [46, 47, 29]. Used to instantiate the cutoff criteria in the examples.
  • domain assumption Asserted comparison for Ising and hard-core samplers: under (5.9)/(5.10), rho >= 0 and alpha, d, t_mix remain of the same order as in the uniform case.
    Examples 5.4-5.5, attributed to Theorem 4.7 and [103]. The alpha comparison is asserted, not derived, in the notes; the rho estimate is deferred to [103].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Modern aspects of Markov chains: entropy, curvature and the cutoff phenomenon." pith.science (2026). https://pith.science/paper/ESS5AKVW

@misc{pith2026250821055,
  author       = {Pith},
  title        = {Pith review of: Modern aspects of Markov chains: entropy, curvature and the cutoff phenomenon},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ESS5AKVW}},
  note         = {Machine review of arXiv:2508.21055}
}
read the original abstract

The cutoff phenomenon is an abrupt transition from out of equilibrium to equilibrium undergone by certain Markov processes in the limit where the size of the state space tends to infinity: instead of decaying gradually over time, their distance to equilibrium remains close to its maximal value for a while and suddenly drops to zero as the time parameter reaches a critical threshold. Discovered four decades ago in the context of card shuffling, this surprising phenomenon has since then been observed in a variety of models, from random walks on groups or complex networks to interacting particle systems. It is now believed to be universal among fast-mixing high-dimensional processes. Yet, current proofs are heavily model-dependent, and identifying the general conditions that trigger a cutoff remains one of the biggest challenges in the quantitative analysis of finite Markov chains. The purpose of these lecture notes is to provide a self-contained introduction to this fascinating question, and to describe its recently-uncovered relations with entropy, curvature and concentration.

Figures

Figures reproduced from arXiv: 2508.21055 by the authors.

Figure 1
Figure 1. Distance to equilibrium and mixing times. [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. The smooth limiting profile F for simple random walk on the n−cycle. To demonstrate this, we now introduce our second toy model, random walk on the n-cube. 13 [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. The blue vertices form an independent set with the largest possible size. [PITH_FULL_IMAGE:figures/full_fig_p031_3.png] view at source ↗

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Markov and lattice bases for Forman-Ricci curvature of graphs

    math.CO 2026-08 conditional novelty 7.0 of 10

    Indispensable Markov moves for sampling graphs with fixed degree and Forman-Ricci curvature sequences have degree at least quadratic in the maximum degree, and degree-3 moves still span the lattice.

Reference graph

Works this paper leans on

118 extracted references · 78 canonical work pages · cited by 1 Pith paper

  1. [103]

    Contractive coupling rates and curvature lower bounds for markov chains, 2023

    Francesco Pedrotti. Contractive coupling rates and curvature lower bounds for markov chains, 2023. 90

    work page 2023

  2. [1]

    Random walks on finite groups and rapidly mixing Markov chains

    David Aldous. Random walks on finite groups and rapidly mixing Markov chains. In Seminar on probability, XVII , volume 986 of Lecture Notes in Math. , pages 243–297. Springer, Berlin, 1983

    1983

  3. [2]

    Hitting times for random walks on vertex-transitive graphs

    David Aldous. Hitting times for random walks on vertex-transitive graphs. Math. Proc. Cambridge Philos. Soc. , 106(1):179–191, 1989

    1989

  4. [3]

    Shuffling cards and stopping times

    David Aldous and Persi Diaconis. Shuffling cards and stopping times. American Mathematical Monthly, pages 333–348, 1986

    1986

  5. [4]

    Comparing with octopi

    Gil Alon and Gady Kozma. Comparing with octopi. Ann. Inst. Henri Poincar´ e Probab. Stat., 56(4):2672–2685, 2020

    2020

  6. [5]

    Random Cayley graphs and expanders

    Noga Alon and Yuval Roichman. Random Cayley graphs and expanders. Random Structures Algorithms, 5(2):271–284, 1994

    1994

  7. [6]

    Spectral independence in high- dimensional expanders and applications to the hardcore model

    Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high- dimensional expanders and applications to the hardcore model. In 2020 IEEE 61st An- nual Symposium on Foundations of Computer Science , pages 1319–1330. IEEE Com- puter Soc., Los Alamitos, CA, [2020] ©2020

    2020

  8. [7]

    Metastability in a con- densing zero-range process in the thermodynamic limit

    In´ es Armend´ ariz, Stefan Grosskinsky, and Michail Loulakis. Metastability in a con- densing zero-range process in the thermodynamic limit. Probab. Theory Related Fields, 169(1-2):105–175, 2017. 82

    2017

Show all 118 references
  1. [8]

    Bakry and Michel ´Emery

    D. Bakry and Michel ´Emery. Diffusions hypercontractives. InS´ eminaire de probabilit´ es, XIX, 1983/84, volume 1123 of Lecture Notes in Math., pages 177–206. Springer, Berlin, 1985

    1983

  2. [9]

    Analysis and geometry of Markov diffusion operators, volume 348 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]

    Dominique Bakry, Ivan Gentil, and Michel Ledoux. Analysis and geometry of Markov diffusion operators, volume 348 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer, Cham, 2014

    2014

  3. [10]

    Characterization of cutoff for reversible Markov chains

    Riddhipratim Basu, Jonathan Hermon, and Yuval Peres. Characterization of cutoff for reversible Markov chains. Ann. Probab., 45(3):1448–1487, 2017

    2017

  4. [11]

    Bate, Stephen B

    Michael E. Bate, Stephen B. Connor, and Oliver Matheau-Raven. Cutoff for a one- sided transposition shuffle. Ann. Appl. Probab., 31(4):1746–1773, 2021

    2021

  5. [12]

    Inequalities in Fourier analysis

    William Beckner. Inequalities in Fourier analysis. Ann. of Math. (2) , 102(1):159–182, 1975

    1975

  6. [13]

    A threshold for cutoff in two-community random graphs

    Anna Ben-Hamou. A threshold for cutoff in two-community random graphs. Ann. Appl. Probab., 30(4):1824–1846, 2020

    2020

  7. [14]

    Cutoff for nonbacktracking random walks on sparse random graphs

    Anna Ben-Hamou and Justin Salez. Cutoff for nonbacktracking random walks on sparse random graphs. Ann. Probab., 45(3):1752–1770, 2017

    2017

  8. [15]

    Cutoff for conjugacy-invariant random walks on the permutation group

    Nathana¨ el Berestycki and Bati S ¸eng¨ ul. Cutoff for conjugacy-invariant random walks on the permutation group. Probab. Theory Related Fields, 173(3-4):1197–1241, 2019

    2019

  9. [16]

    Random walks on the random graph

    Nathana¨ el Berestycki, Eyal Lubetzky, Yuval Peres, and Allan Sly. Random walks on the random graph. Ann. Probab., 46(1):456–490, 2018

    2018

  10. [17]

    Cutoff for random to random card shuffle

    Megan Bernstein and Evita Nestoridi. Cutoff for random to random card shuffle. Ann. Probab., 47(5):3303–3320, 2019

    2019

  11. [18]

    On mixing of Markov chains: coupling, spectral independence, and entropy factorization

    Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel ˇStefankoviˇ c, and Eric Vigoda. On mixing of Markov chains: coupling, spectral independence, and entropy factorization. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pag...

    2022

  12. [19]

    Bobkov and Prasad Tetali

    Sergey G. Bobkov and Prasad Tetali. Modified logarithmic Sobolev inequalities in discrete settings. J. Theoret. Probab., 19(2):289–336, 2006

    2006

  13. [20]

    ´ etude des coefficients de Fourier des fonctions de Lp(G)

    Aline Bonami. ´ etude des coefficients de Fourier des fonctions de Lp(G). Ann. Inst. Fourier (Grenoble), 20:335–402, 1970

    1970

  14. [21]

    Random walk on sparse random digraphs

    Charles Bordenave, Pietro Caputo, and Justin Salez. Random walk on sparse random digraphs. Probab. Theory Related Fields, 170(3-4):933–960, 2018

    2018

  15. [22]

    Cutoff at the entropic time for random walks on covered expander graphs

    Charles Bordenave and Hubert Lacoin. Cutoff at the entropic time for random walks on covered expander graphs. J. Inst. Math. Jussieu , 21(5):1571–1616, 2022

    2022

  16. [23]

    Oxford University Press, Oxford, 2013

    St´ ephane Boucheron, G´ abor Lugosi, and Pascal Massart.Concentration inequalities. Oxford University Press, Oxford, 2013. A nonasymptotic theory of independence, With a foreword by Michel Ledoux

    2013

  17. [24]

    Mixing time of the adjacent walk on the simplex

    Pietro Caputo, Cyril Labb´ e, and Hubert Lacoin. Mixing time of the adjacent walk on the simplex. Ann. Probab., 48(5):2449–2493, 2020

    2020

  18. [25]

    Spectral gap and cutoff phenomenon for the Gibbs sampler of ∇φ interfaces with convex potential

    Pietro Caputo, Cyril Labb´ e, and Hubert Lacoin. Spectral gap and cutoff phenomenon for the Gibbs sampler of ∇φ interfaces with convex potential. Ann. Inst. Henri Poincar´ e Probab. Stat., 58(2):794–826, 2022

    2022

  19. [26]

    Liggett, and Thomas Richthammer

    Pietro Caputo, Thomas M. Liggett, and Thomas Richthammer. Proof of Aldous’ spectral gap conjecture. J. Amer. Math. Soc. , 23(3):831–851, 2010

    2010

  20. [27]

    Entropy and curvature: beyond the Peres-Tetali conjecture

    Pietro Caputo, Florentin M¨ unch, and Justin Salez. Entropy and curvature: beyond the Peres-Tetali conjecture. Trans. Amer. Math. Soc. , 378(5):3551–3571, 2025

    2025

  21. [28]

    Entropy dissipation estimates in a zero-range dy- namics

    Pietro Caputo and Gustavo Posta. Entropy dissipation estimates in a zero-range dy- namics. Probab. Theory Related Fields, 139(1-2):65–87, 2007. MR2322692

    2007

  22. [29]

    On the log-Sobolev constant for the simple random walk on the n-cycle: the even cases

    Guan-Yu Chen and Yuan-Chung Sheu. On the log-Sobolev constant for the simple random walk on the n-cycle: the even cases. J. Funct. Anal. , 202(2):473–485, 2003

    2003

  23. [30]

    Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion

    Zongchen Chen, Kuikui Liu, and Eric Vigoda. Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. InSTOC ’21—Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages 1537–1550. ACM, New York, 2021. 84

    2021

  24. [31]

    Modified log-Sobolev inequalities for strongly log-concave distributions

    Mary Cryan, Heng Guo, and Giorgos Mousa. Modified log-Sobolev inequalities for strongly log-concave distributions. Ann. Probab., 49(1):506–525, 2021

    2021

  25. [32]

    Glauber dynamics for the mean-field potts model

    Paul Cuff, Jian Ding, Oren Louidor, Eyal Lubetzky, Yuval Peres, and Allan Sly. Glauber dynamics for the mean-field potts model. Journal of Statistical Physics , 149(3):432–477, 2012

    2012

  26. [33]

    Logarithmic Sobolev inequality for zero-range dynamics

    Paolo Dai Pra and Gustavo Posta. Logarithmic Sobolev inequality for zero-range dynamics. Ann. Probab., 33(6):2355–2401, 2005. MR2184099

    2005

  27. [34]

    Diaconis and L

    P. Diaconis and L. Saloff-Coste. Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab., 6(3):695–750, 1996

    1996

  28. [35]

    Group representations in probability and statistics , volume 11 of Insti- tute of Mathematical Statistics Lecture Notes—Monograph Series

    Persi Diaconis. Group representations in probability and statistics , volume 11 of Insti- tute of Mathematical Statistics Lecture Notes—Monograph Series . Institute of Mathe- matical Statistics, Hayward, CA, 1988

    1988

  29. [36]

    The cutoff phenomenon in finite Markov chains

    Persi Diaconis. The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. U.S.A., 93(4):1659–1664, 1996

    1996

  30. [37]

    The Markov chain Monte Carlo revolution

    Persi Diaconis. The Markov chain Monte Carlo revolution. Bull. Amer. Math. Soc. (N.S.), 46(2):179–205, 2009

    2009

  31. [38]

    Generating a random permutation with random transpositions

    Persi Diaconis and Mehrdad Shahshahani. Generating a random permutation with random transpositions. Probability Theory and Related Fields , 57(2):159–179, 1981

    1981

  32. [39]

    Total variation cutoff in birth-and-death chains

    Jian Ding, Eyal Lubetzky, and Yuval Peres. Total variation cutoff in birth-and-death chains. Probab. Theory Related Fields, 146(1-2):61–85, 2010

    2010

  33. [40]

    Enumeration and random random walks on finite groups

    Carl Dou and Martin Hildebrand. Enumeration and random random walks on finite groups. Ann. Probab., 24(2):987–1000, 1996

    1996

  34. [41]

    Sharp threshold phenomena in statistical physics

    Hugo Duminil-Copin. Sharp threshold phenomena in statistical physics. Jpn. J. Math., 14(1):1–25, 2019

    2019

  35. [42]

    Lee, and Joseph Lehec

    Ronen Eldan, James R. Lee, and Joseph Lehec. Transport-entropy inequalities and curvature in discrete-space Markov chains. In A journey through discrete mathematics, pages 391–406. Springer, Cham, 2017. 85

    2017

  36. [43]

    K. D. Elworthy. Manifolds and graphs with mostly positive curvatures. In Stochastic analysis and applications (Lisbon, 1989) , volume 26 of Progr. Probab., pages 96–110. Birkh¨ auser Boston, Boston, MA, 1991

    1989

  37. [44]

    Ganguly, E

    S. Ganguly, E. Lubetzky, and F. Martinelli. Cutoff for the east process. Comm. Math. Phys., 335(3):1287–1322, 2015

    2015

  38. [45]

    Mixing times for the simple exclusion process with open boundaries, 2020

    Nina Gantert, Evita Nestoridi, and Dominik Schmid. Mixing times for the simple exclusion process with open boundaries, 2020

    2020

  39. [46]

    Exponential decay of entropy in the random trans- position and Bernoulli-Laplace models

    Fuqing Gao and Jeremy Quastel. Exponential decay of entropy in the random trans- position and Bernoulli-Laplace models. Ann. Appl. Probab., 13(4):1591–1600, 2003

    2003

  40. [47]

    Modified logarithmic Sobolev inequalities for some models of random walk

    Sharad Goel. Modified logarithmic Sobolev inequalities for some models of random walk. Stochastic Process. Appl., 114(1):51–79, 2004

    2004

  41. [48]

    Sharp con- vergence to equilibrium for the ssep with reservoirs, 2021

    Patr ´ ıcia Gon¸ calves, Milton Jara, Rodrigo Marinho, and Ot´ avio Menezes. Sharp con- vergence to equilibrium for the ssep with reservoirs, 2021

    2021

  42. [49]

    Logarithmic Sobolev inequalities

    Leonard Gross. Logarithmic Sobolev inequalities. Amer. J. Math. , 97(4):1061–1083, 1975

    1975

  43. [50]

    W. K. Hastings. Monte Carlo sampling methods using Markov chains and their appli- cations. Biometrika, 57(1):97–109, 1970

    1970

  44. [51]

    Cutoff for Ramanujan graphs via degree inflation

    Jonathan Hermon. Cutoff for Ramanujan graphs via degree inflation. Electron. Com- mun. Probab., 22:Paper No. 45, 10, 2017

    2017

  45. [52]

    Cutoff for almost all random walks on abelian groups, 2021

    Jonathan Hermon and Sam Olesker-Taylor. Cutoff for almost all random walks on abelian groups, 2021

    2021

  46. [53]

    Cutoff for random walks on upper trian- gular matrices, 2021

    Jonathan Hermon and Sam Olesker-Taylor. Cutoff for random walks on upper trian- gular matrices, 2021

    2021

  47. [54]

    Further results and discussions on random cayley graphs, 2021

    Jonathan Hermon and Sam Olesker-Taylor. Further results and discussions on random cayley graphs, 2021

    2021

  48. [55]

    Geometry of random cayley graphs of abelian groups, 2021

    Jonathan Hermon and Sam Olesker-Taylor. Geometry of random cayley graphs of abelian groups, 2021. 86

    2021

  49. [56]

    The exclusion process mixes (almost) faster than independent particles

    Jonathan Hermon and Richard Pymar. The exclusion process mixes (almost) faster than independent particles. Ann. Probab., 48(6):3077–3123, 2020

    2020

  50. [57]

    A version of Aldous’ spectral-gap conjecture for the zero range process

    Jonathan Hermon and Justin Salez. A version of Aldous’ spectral-gap conjecture for the zero range process. Ann. Appl. Probab., 29(4):2217–2229, 2019

    2019

  51. [58]

    Cutoff for the mean-field zero-range process with bounded monotone rates

    Jonathan Hermon and Justin Salez. Cutoff for the mean-field zero-range process with bounded monotone rates. Ann. Probab., 48(2):742–759, 2020

    2020

  52. [59]

    Entropy dissipation estimates for inhomogeneous zero-range processes

    Jonathan Hermon and Justin Salez. Entropy dissipation estimates for inhomogeneous zero-range processes. Ann. Appl. Probab., 31(5):2275–2283, 2021

    2021

  53. [60]

    The interchange process on high-dimensional products

    Jonathan Hermon and Justin Salez. The interchange process on high-dimensional products. Ann. Appl. Probab., 31(1):84–98, 2021

    2021

  54. [61]

    Universality of cutoff for graphs with an added random matching

    Jonathan Hermon, Allan Sly, and Perla Sousi. Universality of cutoff for graphs with an added random matching. Ann. Probab., 50(1):203–240, 2022

    2022

  55. [62]

    Cutoff for random walk on random graphs with a community structure, 2022

    Jonathan Hermon, An dela ˇSarkovi´ c, and Perla Sousi. Cutoff for random walk on random graphs with a community structure, 2022

    2022

  56. [63]

    Random walks supported on random points of Z/nZ

    Martin Hildebrand. Random walks supported on random points of Z/nZ. Probab. Theory Related Fields, 100(2):191–203, 1994

    1994

  57. [64]

    A survey of results on random random walks on finite groups

    Martin Hildebrand. A survey of results on random random walks on finite groups. Probab. Surv., 2:33–63, 2005

    2005

  58. [65]

    Expander graphs and their appli- cations

    Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their appli- cations. Bull. Amer. Math. Soc. (N.S.) , 43(4):439–561, 2006

    2006

  59. [66]

    Riemannian geometry and geometric analysis

    J¨ urgen Jost. Riemannian geometry and geometric analysis . Universitext. Springer, Cham, seventh edition, 2017

    2017

  60. [67]

    The influence of variables on Boolean func- tions

    Jeff Kahn, Gil Kalai, and Nathan Linial. The influence of variables on Boolean func- tions. In 29th Annual Symposium on Foundations of Computer Science , pages 68–80. IEEE Comput. Soc. Press, Washington, DC, [1988] ©1988

    1988

  61. [68]

    Optimal lossless compression: Source varen- tropy and dispersion

    Ioannis Kontoyiannis and Sergio Verdu. Optimal lossless compression: Source varen- tropy and dispersion. pages 1739–1743, 07 2013. 87

    2013

  62. [69]

    Cutoff phenomenon for the asymmetric simple exclu- sion process and the biased card shuffling

    Cyril Labb´ e and Hubert Lacoin. Cutoff phenomenon for the asymmetric simple exclu- sion process and the biased card shuffling. Ann. Probab., 47(3):1541–1586, 2019

    2019

  63. [70]

    The cutoff profile for the simple exclusion process on the circle

    Hubert Lacoin. The cutoff profile for the simple exclusion process on the circle. Ann. Probab., 44(5):3399–3430, 2016

    2016

  64. [71]

    Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion

    Hubert Lacoin. Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion. Ann. Probab., 44(2):1426–1487, 2016

    2016

  65. [72]

    The simple exclusion process on the circle has a diffusive cutoff window

    Hubert Lacoin. The simple exclusion process on the circle has a diffusive cutoff window. Ann. Inst. Henri Poincar´ e Probab. Stat., 53(3):1402–1437, 2017

    2017

  66. [73]

    Concentration of measure and logarithmic Sobolev inequalities

    Michel Ledoux. Concentration of measure and logarithmic Sobolev inequalities. In S´ eminaire de Probabilit´ es, XXXIII, volume 1709 of Lecture Notes in Math. , pages 120–216. Springer, Berlin, 1999

    1999

  67. [74]

    Glauber dynamics for the mean- field Ising model: cut-off, critical power law, and metastability

    David A Levin, Malwina J Luczak, and Yuval Peres. Glauber dynamics for the mean- field Ising model: cut-off, critical power law, and metastability. Probability Theory and Related Fields, 146(1-2):223–265, 2010

    2010

  68. [75]

    Coupling from the past

    David A. Levin and Yuval Peres. Markov chains and mixing times . American Math- ematical Society, Providence, RI, 2017. Second edition of [ MR2466937], With con- tributions by Elizabeth L. Wilmer, With a chapter on “Coupling from the past” by James G. Propp and David B. Wilson

    2017

  69. [76]

    Thomas M. Liggett. Stochastic interacting systems: contact, voter and exclusion pro- cesses, volume 324 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer-Verlag, Berlin, 1999. MR1717346

    1999

  70. [77]

    Thomas M. Liggett. Interacting particle systems . Classics in Mathematics. Springer- Verlag, Berlin, 2005. Reprint of the 1985 original

    2005

  71. [78]

    Ricci curvature and eigenvalue estimate on locally finite graphs

    Yong Lin and Shing-Tung Yau. Ricci curvature and eigenvalue estimate on locally finite graphs. Math. Res. Lett. , 17(2):343–356, 2010

    2010

  72. [79]

    Cutoff on all Ramanujan graphs

    Eyal Lubetzky and Yuval Peres. Cutoff on all Ramanujan graphs. Geom. Funct. Anal., 26(4):1190–1216, 2016. 88

    2016

  73. [80]

    Cutoff phenomena for random walks on random regular graphs

    Eyal Lubetzky and Allan Sly. Cutoff phenomena for random walks on random regular graphs. Duke Math. J. , 153(3):475–510, 2010

    2010

  74. [81]

    Explicit expanders with cutoff phenomena

    Eyal Lubetzky and Allan Sly. Explicit expanders with cutoff phenomena. Electron. J. Probab., 16:no. 15, 419–435, 2011

    2011

  75. [82]

    Cutoff for the Ising model on the lattice

    Eyal Lubetzky and Allan Sly. Cutoff for the Ising model on the lattice. Invent. Math., 191(3):719–755, 2013

    2013

  76. [83]

    Cutoff for general spin systems with arbitrary boundary conditions

    Eyal Lubetzky and Allan Sly. Cutoff for general spin systems with arbitrary boundary conditions. Communications on Pure and Applied Mathematics , 67(6):982–1027, 2014

    2014

  77. [84]

    An exposition to information percolation for the Ising model

    Eyal Lubetzky and Allan Sly. An exposition to information percolation for the Ising model. Ann. Fac. Sci. Toulouse Math. (6) , 24(4):745–761, 2015

    2015

  78. [85]

    Information percolation and cutoff for the stochastic Ising model

    Eyal Lubetzky and Allan Sly. Information percolation and cutoff for the stochastic Ising model. J. Amer. Math. Soc. , 29(3):729–774, 2016

    2016

  79. [86]

    Universality of cutoff for the Ising model

    Eyal Lubetzky and Allan Sly. Universality of cutoff for the Ising model. Ann. Probab., 45(6A):3664–3696, 2017

    2017

  80. [87]

    Lectures on Glauber dynamics for discrete spin models

    Fabio Martinelli. Lectures on Glauber dynamics for discrete spin models. In Lectures on probability theory and statistics (Saint-Flour, 1997) , volume 1717 of Lecture Notes in Math. , pages 93–191. Springer, Berlin, 1999

    1997

  81. [88]

    Cutoff for the mean-field zero-range process

    Mathieu Merle and Justin Salez. Cutoff for the mean-field zero-range process. Ann. Probab., 47(5):3170–3201, 2019

    2019

  82. [89]

    Rosenbluth, Marshall N

    Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller. Equation of state calculations by fast computing machines. The Journal of Chemical Physics , 21(6):1087–1092, 1953

    1953

  83. [90]

    Mathematical aspects of mixing times in Markov chains

    Ravi Montenegro and Prasad Tetali. Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. , 1(3):x+121, 2006

    2006

  84. [91]

    Spectral gap for the zero range process with constant rate

    Ben Morris. Spectral gap for the zero range process with constant rate. Ann. Probab., 34(5):1645–1664, 2006. MR2271475. 89

    2006

  85. [92]

    Ollivier curvature, isoperimetry, concentration, and log-Sobolev inequalitiy, 2023

    Florentin M¨ unch. Ollivier curvature, isoperimetry, concentration, and log-Sobolev inequalitiy, 2023

    2023

  86. [93]

    Cutoff for the Swendsen-Wang dynamics on the lattice

    Danny Nam and Allan Sly. Cutoff for the Swendsen-Wang dynamics on the lattice. Ann. Probab., 47(6):3705–3761, 2019

    2019

  87. [94]

    On the Banach-space-valued Azuma inequality and small-set isoperimetry of Alon-Roichman graphs

    Assaf Naor. On the Banach-space-valued Azuma inequality and small-set isoperimetry of Alon-Roichman graphs. Combin. Probab. Comput. , 21(4):623–634, 2012

    2012

  88. [95]

    Limit profiles for reversible Markov chains

    Evita Nestoridi and Sam Olesker-Taylor. Limit profiles for reversible Markov chains. Probab. Theory Related Fields, 182(1-2):157–188, 2022

    2022

  89. [96]

    Analysis of Boolean functions

    Ryan O’Donnell. Analysis of Boolean functions . Cambridge University Press, New York, 2014

    2014

  90. [97]

    Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk

    Roberto Imbuzeiro Oliveira. Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk. Ann. Probab., 41(2):871–913, 2013

    2013

  91. [98]

    Ricci curvature of metric spaces

    Yann Ollivier. Ricci curvature of metric spaces. C. R. Math. Acad. Sci. Paris , 345(11):643–646, 2007

    2007

  92. [99]

    Ricci curvature of Markov chains on metric spaces

    Yann Ollivier. Ricci curvature of Markov chains on metric spaces. J. Funct. Anal. , 256(3):810–864, 2009

    2009

  93. [100]

    A survey of Ricci curvature for metric spaces and Markov chains

    Yann Ollivier. A survey of Ricci curvature for metric spaces and Markov chains. In Probabilistic approach to geometry, volume 57 of Adv. Stud. Pure Math., pages 343–381. Math. Soc. Japan, Tokyo, 2010

    2010

  94. [101]

    An entropic proof of cutoff on Ramanujan graphs

    Narutaka Ozawa. An entropic proof of cutoff on Ramanujan graphs. Electron. Com- mun. Probab., 25:Paper No. 77, 8, 2020

    2020

  95. [102]

    Random Cayley graphs with O(log |G|) generators are expanders

    Igor Pak. Random Cayley graphs with O(log |G|) generators are expanders. In Algorithms—ESA ’99 (Prague) , volume 1643 of Lecture Notes in Comput. Sci. , pages 521–526. Springer, Berlin, 1999

    1999

  96. [104]

    A new cutoff criterion for non-negatively curved chains, 2025

    Francesco Pedrotti and Justin Salez. A new cutoff criterion for non-negatively curved chains, 2025

    2025

  97. [105]

    Aim research workshop on sharp thresholds for mixing times

    Y Peres. Aim research workshop on sharp thresholds for mixing times. 2004

    2004

  98. [106]

    Tyrrell Rockafellar

    R. Tyrrell Rockafellar. Convex analysis. Princeton Landmarks in Mathematics. Prince- ton University Press, Princeton, NJ, 1997. Reprint of the 1970 original, Princeton Paperbacks

    1997

  99. [107]

    Universality of cutoff for exclusion with reservoirs

    Justin Salez. Universality of cutoff for exclusion with reservoirs. Ann. Probab., 51, 2023

    2023

  100. [108]

    Cutoff for non-negatively curved Markov chains

    Justin Salez. Cutoff for non-negatively curved Markov chains. J. Eur. Math. Soc. (JEMS), 26(11):4375–4392, 2024

    2024

  101. [109]

    Cutoff for non-negatively curved diffusions, 2025

    Justin Salez. Cutoff for non-negatively curved diffusions, 2025

    2025

  102. [110]

    Intrinsic regularity in the discrete log-sobolev inequal- ity, 2025

    Justin Salez and Pierre Youssef. Intrinsic regularity in the discrete log-sobolev inequal- ity, 2025

    2025

  103. [111]

    Curvature of nonlocal Markov generators

    Michael Schmuckenschl¨ ager. Curvature of nonlocal Markov generators. In Convex geometric analysis (Berkeley, CA, 1996) , volume 34 of Math. Sci. Res. Inst. Publ. , pages 189–197. Cambridge Univ. Press, Cambridge, 1999

    1996

  104. [112]

    Interaction of Markov processes

    Frank Spitzer. Interaction of Markov processes. Advances in Math., 5:246–290 (1970),

    1970

  105. [113]

    Sharp relations between volume growth, isoperimetry and resistance in vertex-transitive graphs, 2020

    Romain Tessera and Matthew Tointon. Sharp relations between volume growth, isoperimetry and resistance in vertex-transitive graphs, 2020

    2020

  106. [114]

    Romain Tessera and Matthew C. H. Tointon. A finitary structure theorem for vertex- transitive graphs of polynomial growth. Combinatorica, 41(2):263–298, 2021

    2021

  107. [115]

    Limit profile for random transpositions

    Lucas Teyssier. Limit profile for random transpositions. Ann. Probab., 48(5):2323– 2343, 2020

    2020

  108. [116]

    The mean-field zero-range process with unbounded monotone rates: mixing time, cutoff, and poincar´ e constant, 2021

    Hong-Quan Tran. The mean-field zero-range process with unbounded monotone rates: mixing time, cutoff, and poincar´ e constant, 2021. 91

    2021

  109. [117]

    Mixing times of Lozenge tiling and card shuffling Markov chains

    David Bruce Wilson. Mixing times of Lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab., 14(1):274–325, 2004

    2004

  110. [118]

    Cutoff for polymer pinning dynamics in the repulsive phase

    Shangjie Yang. Cutoff for polymer pinning dynamics in the repulsive phase. Ann. Inst. Henri Poincar´ e Probab. Stat., 57(3):1306–1335, 2021. 92

    2021

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.