Mixing Time Bounds via Bottleneck Sequences

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.

Saved in:
Bibliographic Details
Published inJournal of statistical physics Vol. 173; no. 3-4; pp. 845 - 871
Main Authors Addario-Berry, Louigi, Roberts, Matthew I.
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2018
Springer Nature B.V
Subjects
Markov chains
Mathematical and Computational Physics
Physical Chemistry
Physics
Physics and Astronomy
Quantum Physics
Statistical Physics and Dynamical Systems
Theoretical
Upper bounds
Mixing times
Isoperimetric profile
Rough isometry
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0022-4715
1572-9613
DOI:10.1007/s10955-017-1917-5