Mixing times of random walks on dynamic configuration models

Luca Avena, Hakan Guldas, Remco van der Hofstad +1

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$.…