Sensitivity of mixing times, an example
Probability
2021-05-13 v1
Abstract
We construct a family of growing finite bounded degree rooted graphs, , in which the mixing time for simple random walk, starting at the root, is order . Yet after a quasi - isometry, the ratio of over the mixing time grows arbitrarily slow to infinity.
Cite
@article{arxiv.2105.05766,
title = {Sensitivity of mixing times, an example},
author = {Itai Benjamini},
journal= {arXiv preprint arXiv:2105.05766},
year = {2021}
}