Sensitivity of mixing times of Cayley graphs

Abstract

We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio of the two mixing times goes to infinity. The Cayley graphs serving as an example have unbounded degrees. For non-transitive graphs we construct bounded degree graphs for which the mixing time from the worst starting point for one graph is asymptotically smaller than the mixing time from the best starting point of the random walk on a network obtained by increasing some of the edge weights from 1 to $1+o(1)$.

arXiv comment33 pages, 2 figure. In this version we improved the presentation

References in corpus (8)

• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• Characterization of cutoff for reversible Markov chains
• On sensitivity of mixing times and cutoff
• On sensitivity of uniform mixing times
• Total Variation and Separation Cutoffs are not equivalent and neither one implies the other
• The power of averaging at two consecutive time steps: Proof of a mixing conjecture by Aldous and Fill
• Mixing time bounds via bottleneck sequences
• On the precision of the spectral profile

Cited by in corpus (1)

• Sensitivity of mixing times, an example