Characterization of cutoff for reversible Markov chains

Cited In (41)

A first hitting time approach to finding effective spreaders in a network
Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance
Mixing time bounds for edge flipping on regular graphs
Universality of cutoff for exclusion with reservoirs
On an epidemic model on finite graphs
Cutoff for permuted Markov chains
Total variation cutoff in birth-and-death chains
Cutoff at the ``entropic time for sparse Markov chains
Frogs on trees?
Continuum versus discrete networks, graph Laplacians, and reproducing kernel Hilbert spaces
The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise
No cutoff in spherically symmetric trees
On sensitivity of mixing times and cutoff
Antiduality and Möbius monotonicity: generalized coupon collector problem
The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
The cutoff phenomenon for random birth and death chains
Excessive symmetry can preclude cutoff
Characterization of cutoff for reversible Markov chains
Mixing trichotomy for an Ehrenfest urn with impurities
Cutoff ergodicity bounds in Wasserstein distance for a viscous energy shell model with Lévy noise
Sensitivity of mixing times of Cayley graphs
Mixing times for the commuting chain on CA groups
Using Bernoulli maps to accelerate mixing of a random walk on the torus
The full spectrum of random walks on complete finite \(d\)-ary trees
Cutoff phenomenon for nearest Lamperti's random walk
Mixing reversible Markov chains in the max-\(\ell^2\)-distance
Sparse reconstruction in spin systems. I: iid spins
On sensitivity of uniform mixing times
A spectral characterization for concentration of the cover time
Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS
Limit profiles for projections of random walks on groups
Limit profiles for reversible Markov chains
Decay rates and cutoff for convergence and hitting times of Markov chains with countably infinite state space
Cutoff for the Fredrickson-Andersen one spin facilitated model
A comparison principle for random walk on dynamical percolation
Cutoff for non-negatively curved Markov chains
A technical report on hitting times, mixing and cutoff
Some inequalities for reversible Markov chains and branching random walks via spectral optimization
Cutoff on trees is rare
A threshold for cutoff in two-community random graphs

This page was built for publication: Characterization of cutoff for reversible Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012242)