Mixing times of random walks on dynamic configuration models

Abstract

The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random graph becomes {\em dynamic}, namely, at each unit of time a fraction ${\alpha }_n$ of the edges is randomly rewired. Under mild conditions on the degree sequence, guaranteeing that the graph is locally tree-like, we show that for every $\epsilon \in (0,1)$ the $\epsilon$-mixing time of random walk without backtracking grows like $\sqrt{2\log (1/\epsilon )/\log (1/(1-{\alpha }_n))}$ as $n\to \infty$, provided that ${\lim }_{n\to \infty }{\alpha }_n(\log n{)}^2=\infty$. The latter condition corresponds to a regime of fast enough graph dynamics. Our proof is based on a randomised stopping time argument, in combination with coupling techniques and combinatorial estimates. The stopping time of interest is the first time that the walk moves along an edge that was rewired before, which turns out to be close to a strong stationary time.

23 pages, 6 figures. Previous version contained a mistake in one of the proofs. In this version we look at nonbacktracking random walk instead of simple random walk