Mixing time bounds via bottleneck sequences

Abstract

We provide new upper bounds for mixing times of general finite Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.

28 pages. Title changed, other minor changes. This version accepted by the Journal of Statistical Physics

References in corpus (2)

• On sensitivity of uniform mixing times
• On the precision of the spectral profile

Cited by in corpus (4)

• On sensitivity of mixing times and cutoff
• On sensitivity of uniform mixing times
• Sensitivity of mixing times of Cayley graphs
• Markov chains on hyperbolic-like groups and quasi-isometries