Characterization of cutoff for reversible Markov chains
From MaRDI portal
Publication:2012242
A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. A chain is called lazy if \(P(x,x) \geqslant {1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-\nulldelimiterspace} 2}\), for all \(x\). Theorem 1 gives a sharp spectral condition for cutoff in lazy weighted nearest-neighbor random walks on trees. Theorem 2 gives conditions for cutoff to exhibit for a generalization of birth and death chains. Theorem 3 considers sequences of lazy reversible irreducible finite chains.
Recommendations
- Characterization of cutoff for reversible Markov chains
- Total variation cutoff in birth-and-death chains
- A technical report on hitting times, mixing and cutoff
- Total variation and separation cutoffs are not equivalent and neither one implies the other
- Cutoff for Markov chains: some examples and applications
Cited in
(59)- No cut-off phenomenon for the ``Insect Markov chain
- Cutoffs for product chains
- On sensitivity of uniform mixing times
- The \(L^{2}\)-cutoffs for reversible Markov chains
- The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
- Cutoff at the ``entropic time for sparse Markov chains
- Frogs on trees?
- On sensitivity of mixing times 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
- Limit profiles for reversible Markov chains
- Mixing times for the commuting chain on CA groups
- No cutoff in spherically symmetric trees
- Some inequalities for reversible Markov chains and branching random walks via spectral optimization
- Cutoff phenomenon for nearest Lamperti's random walk
- On an epidemic model on finite graphs
- A spectral characterization for concentration of the cover time
- A comparison principle for random walk on dynamical percolation
- The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise
- The \(L^{2}\)-cutoff for reversible Markov processes
- A product chain without cutoff
- A threshold for cutoff in two-community random graphs
- Cutoff for permuted Markov chains
- Decay rates and cutoff for convergence and hitting times of Markov chains with countably infinite state space
- Cutoff for Markov chains: some examples and applications
- The cutoff phenomenon for random birth and death chains
- Total variation and separation cutoffs are not equivalent and neither one implies the other
- Cutoff for samples of Markov chains
- A technical report on hitting times, mixing and cutoff
- A first hitting time approach to finding effective spreaders in a network
- Cutoff for the Fredrickson-Andersen one spin facilitated model
- Cutoff at the entropic time for random walks on covered expander graphs
- Characterization of cutoff for reversible Markov chains
- Comparison of cutoffs between lazy walks and Markovian semigroups
- Antiduality and Möbius monotonicity: generalized coupon collector problem
- Total variation cutoff in a tree
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
- Mixing time bounds for edge flipping on regular graphs
- Universality of cutoff for exclusion with reservoirs
- Using Bernoulli maps to accelerate mixing of a random walk on the torus
- Cutoff on trees is rare
- The varentropy criterion is sharp on expanders
- Cutoff ergodicity bounds in Wasserstein distance for a viscous energy shell model with Lévy noise
- Excessive symmetry can preclude cutoff
- Mixing trichotomy for an Ehrenfest urn with impurities
- Cutoff for non-negatively curved Markov chains
- Sensitivity of mixing times of Cayley graphs
- Mixing reversible Markov chains in the max-\(\ell^2\)-distance
- Sparse reconstruction in spin systems. I: iid spins
- Limit profiles for projections of random walks on groups
- On iteration in discrete probabilistic programming
- Phase transition for random walks on graphs with added weighted random matching
- Families of infinite parabolic IFS with overlaps: the approximating method
- Cutoff for random walk on random graphs with a community structure
- Cutoff for geodesic paths on hyperbolic manifolds
- Cutoff for non-negatively curved diffusions
- Cutoff thermalization for Ornstein-Uhlenbeck systems with small Lévy noise in the Wasserstein distance
- Total variation cutoff in birth-and-death chains
- Separation cut-offs for birth and death chains
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)
