Sensitivity of mixing times, an example
Abstract
We construct a family of growing finite bounded degree rooted graphs, Gn, in which the mixing time for simple random walk, starting at the root, is order |Gn|. Yet after a quasi - isometry, the ratio of |Gn| over the mixing time grows arbitrarily slow to infinity.
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.