Mixing time bounds via the spectral profile

DOI10.1214/EJP.v11-300zbMath1109.60061arXivmath/0505690OpenAlexW1996447604MaRDI QIDQ850392

Ravi Montenegro, Prasad Tetali, Sharad Goel

Publication date: 3 November 2006

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505690

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Theory of computing (68Q99)

Related Items

The generalized distance spectrum of a graph and applications ⋮ On sensitivity of uniform mixing times ⋮ Rapid social connectivity ⋮ Unnamed Item ⋮ The mixing time of the giant component of a random graph ⋮ Cutoff for lamplighter chains on fractals ⋮ On an epidemic model on finite graphs ⋮ A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities ⋮ Comparison theory for Markov chains on different state spaces and application to random walk on derangements ⋮ Mixing of the square plaquette model on a critical length scale ⋮ Sensitivity of Mixing Times in Eulerian Digraphs ⋮ A comparison principle for random walk on dynamical percolation ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ Cutoff for the square plaquette model on a critical length scale ⋮ Frogs on trees? ⋮ On sensitivity of mixing times and cutoff ⋮ Isoperimetric inequalities and mixing time for a random walk on a random point process ⋮ Poincaré profiles of groups and spaces ⋮ Mixing time bounds via bottleneck sequences ⋮ Random walks among time increasing conductances: heat kernel estimates ⋮ Unnamed Item ⋮ Anomalous heat-kernel decay for random walk among bounded random conductances ⋮ A technical report on hitting times, mixing and cutoff ⋮ Coalescing and branching simple symmetric exclusion process