Mixing time bounds via bottleneck sequences
Probability
2017-12-06 v3
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.
Cite
@article{arxiv.1610.07874,
title = {Mixing time bounds via bottleneck sequences},
author = {Louigi Addario-Berry and Matthew I. Roberts},
journal= {arXiv preprint arXiv:1610.07874},
year = {2017}
}
Comments
28 pages. Title changed, other minor changes. This version accepted by the Journal of Statistical Physics