Mixing time bounds via bottleneck sequences
From MaRDI portal
Publication:1756546
DOI10.1007/s10955-017-1917-5zbMath1403.60060arXiv1610.07874OpenAlexW2768038943MaRDI QIDQ1756546
Matthew I. Roberts, Louigi Addario-Berry
Publication date: 21 December 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07874
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (3)
No cutoff in spherically symmetric trees ⋮ On sensitivity of uniform mixing times ⋮ On sensitivity of mixing times and cutoff
Cites Work
- Unnamed Item
- Unnamed Item
- Coarse geometry and randomness. École d'Été de Probabilités de Saint-Flour XLI -- 2011
- Cover times, blanket times, and majorizing measures
- Mixing and hitting times for finite Markov chains
- Mixing times are hitting times of large sets
- Sensitivity of mixing times
- Mixing time bounds via the spectral profile
- Faster mixing and small bottlenecks
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- Evolving sets, mixing and heat kernel bounds
- Faster mixing via average conductance
- Tight inequalities among set hitting times in Markov chains
- On the precision of the spectral profile
- Some Inequalities for Reversible Markov Chains
- Random walks on random trees
This page was built for publication: Mixing time bounds via bottleneck sequences
