Convergence of mixing times for sequences of random walks on finite graphs

Journal article

We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a suitable Gromov-Hausdorff sense. With this result we are able to establish the convergence of the mixing times on the largest component of the Erdo{double acute accent}s-Rényi random graph in the critical window, sharpening previous results for this random graph model. Our results also enable us to establish convergence in a number of other examples, such as finitely ramified fractal graphs, Galton-Watson trees and the range of a high-dimensional random walk.

Authors: Croydon, D; Hambly, B; Kumagai, T

• Publication status: Published
• Journal: ELECTRONIC JOURNAL OF PROBABILITY
• Volume: 17
• Issue: 0
• Pages: 1-32
• Publication date: 2012-01-05
• DOI: 10.1214/EJP.v17-1705
• EISSN: 1083-6489
• ISSN: 1083-6489
• Language: English
• Keywords: mixing; fractal graph; random graph; random walk; Galton-Watson tree; Gromov-Hausdorff convergence