Intersection conductance and canonical alternating paths, methods for general finite Markov chains
Combinatorics
2019-02-20 v4 Probability
Abstract
We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show that a known bound for mixing time of a lazy walk on a Cayley graph with symmetric generating set also applies to the non-lazy non-symmetric case, often even when there is no holding probability.
Keywords
Cite
@article{arxiv.math/0611585,
title = {Intersection conductance and canonical alternating paths, methods for general finite Markov chains},
author = {Ravi Montenegro},
journal= {arXiv preprint arXiv:math/0611585},
year = {2019}
}
Comments
18 pages