Abstract
In this note, we demonstrate an instance of undirected 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.
Author supplied keywords
Cite
CITATION STYLE
APA
Ding, J., & Peres, Y. (2013). Sensitivity of mixing times. Electronic Communications in Probability, 18. https://doi.org/10.1214/ECP.v18-2765
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free