Sensitivity of mixing times
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 n/ n if we multiply the edge-conductances by bounded factors in a certain way.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.