On sensitivity of uniform mixing times
Abstract
We show that the order of the L∞-mixing time of simple random walks on a sequence of uniformly bounded degree graphs of size n may increase by an optimal factor of ( n) as a result of a bounded perturbation of the edge weights. This answers a question and a conjecture of Kozma.
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.