Random walks on the random graph
ANNALS OF PROBABILITY, pp. 456.0-490.0, 2018.
We study random walks on the giant component of the Erdos-Renyi random graph G(n, p) where p = lambda/n for lambda > 1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log(2) n. We prove that starting from a uniform vertex (equivalently,...More
PPT (Upload PPT)