Translator Disclaimer
2013 Sensitivity of mixing times
Jian Ding, Yuval Peres
Author Affiliations +
Electron. Commun. Probab. 18: 1-6 (2013). DOI: 10.1214/ECP.v18-2765

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.

Citation

Download Citation

Jian Ding. Yuval Peres. "Sensitivity of mixing times." Electron. Commun. Probab. 18 1 - 6, 2013. https://doi.org/10.1214/ECP.v18-2765

Information

Accepted: 11 November 2013; Published: 2013
First available in Project Euclid: 7 June 2016

zbMATH: 1307.60051
MathSciNet: MR3141797
Digital Object Identifier: 10.1214/ECP.v18-2765

Subjects:
Primary: 60J10

JOURNAL ARTICLE
6 PAGES


SHARE
Back to Top