@article{ECP2765,
author = {Jian Ding and Yuval Peres},
title = {Sensitivity of mixing times},
journal = {Electron. Commun. Probab.},
fjournal = {Electronic Communications in Probability},
volume = {18},
year = {2013},
keywords = {mixing time; sensitivity; geometric bounds.},
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.},
pages = {no. 88, 1-6},
issn = {1083-589X},
doi = {10.1214/ECP.v18-2765},
url = {http://ecp.ejpecp.org/article/view/2765}}