Characterization of cutoff for reversible Markov chains
From MaRDI portal
Publication:2012242
DOI10.1214/16-AOP1090zbMath1374.60129MaRDI QIDQ2012242
Jonathan Hermon, Yuval Peres, Riddhipratim Basu
Publication date: 28 July 2017
Published in: The Annals of Probability (Search for Journal in Brave)
Related Items
Antiduality and Möbius monotonicity: generalized coupon collector problem, Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance, No cutoff in spherically symmetric trees, On sensitivity of uniform mixing times, Some inequalities for reversible Markov chains and branching random walks via spectral optimization, A threshold for cutoff in two-community random graphs, Cutoff phenomenon for nearest Lamperti's random walk, On an epidemic model on finite graphs, CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS, Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022, Mixing time bounds for edge flipping on regular graphs, Cutoff for permuted Markov chains, Universality of cutoff for exclusion with reservoirs, Using Bernoulli maps to accelerate mixing of a random walk on the torus, The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill, A spectral characterization for concentration of the cover time, The cutoff phenomenon for random birth and death chains, A comparison principle for random walk on dynamical percolation, Cutoff at the ``entropic time for sparse Markov chains, The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise, Frogs on trees?, On sensitivity of mixing times and cutoff, Cutoff for the Fredrickson-Andersen one spin facilitated model, A technical report on hitting times, mixing and cutoff, Continuum versus discrete networks, graph Laplacians, and reproducing kernel Hilbert spaces, The full spectrum of random walks on complete finite \(d\)-ary trees, A first hitting time approach to finding effective spreaders in a network, Mixing times for the commuting chain on CA groups
