Sensitivity of mixing times

Jian Ding; Yuval Peres

Sensitivity of mixing times

Probability 2013-04-02 v1

Authors: Jian Ding , Yuval Peres

Abstract

In this note, we demonstrate an instance of bounded-degree graphs of size $n$ , for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by bounded factors in a certain way.

Keywords

mixing times random walks random walk on graphs

Cite

@article{arxiv.1304.0244,
  title  = {Sensitivity of mixing times},
  author = {Jian Ding and Yuval Peres},
  journal= {arXiv preprint arXiv:1304.0244},
  year   = {2013}
}

Comments

7pages, 2 figures

Related papers

View all related →