## The Annals of Probability

### Random walks on the random graph

#### Abstract

We study random walks on the giant component of the Erdős–Rényi random graph $\mathcal{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, from a fixed vertex conditioned to belong to the giant) both accelerates mixing to $O(\log n)$ and concentrates it (the cutoff phenomenon occurs): the typical mixing is at $(\nu\mathbf{d})^{-1}\log n\pm(\log n)^{1/2+o(1)}$, where $\nu$ and $\mathbf{d}$ are the speed of random walk and dimension of harmonic measure on a $\operatorname{Poisson}(\lambda)$-Galton–Watson tree. Analogous results are given for graphs with prescribed degree sequences, where cutoff is shown both for the simple and for the nonbacktracking random walk.

#### Article information

Source
Ann. Probab., Volume 46, Number 1 (2018), 456-490.

Dates
Revised: October 2016
First available in Project Euclid: 5 February 2018

https://projecteuclid.org/euclid.aop/1517821227

Digital Object Identifier
doi:10.1214/17-AOP1189

Mathematical Reviews number (MathSciNet)
MR3758735

Zentralblatt MATH identifier
06865127

#### Citation

Berestycki, Nathanaël; Lubetzky, Eyal; Peres, Yuval; Sly, Allan. Random walks on the random graph. Ann. Probab. 46 (2018), no. 1, 456--490. doi:10.1214/17-AOP1189. https://projecteuclid.org/euclid.aop/1517821227

#### References

• [1] Alon, N. and Spencer, J. H. (2008). The Probabilistic Method, 3rd ed. Wiley, Hoboken, NJ.
• [2] Athreya, K. B. and Ney, P. E. (2004). Branching Processes. Dover, Mineola, NY. Reprint of the 1972 original [Springer, New York; MR0373040].
• [3] Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation. Oxford Studies in Probability 2. Clarendon, Oxford.
• [4] Ben-Hamou, A. and Salez, J. (2017). Cutoff for nonbacktracking random walks on sparse random graphs. Ann. Probab. 45 1752–1770.
• [5] Benjamini, I., Kozma, G. and Wormald, N. (2014). The mixing time of the giant component of a random graph. Random Structures Algorithms 45 383–407.
• [6] Berestycki, N. and Durrett, R. (2008). Limiting behavior for the distance of a random walk. Electron. J. Probab. 13 374–395.
• [7] Bollobás, B. (1984). The evolution of random graphs. Trans. Amer. Math. Soc. 286 257–274.
• [8] Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge University Press, Cambridge.
• [9] Dembo, A., Gantert, N., Peres, Y. and Zeitouni, O. (2002). Large deviations for random walks on Galton–Watson trees: Averaging and uncertainty. Probab. Theory Related Fields 122 241–288.
• [10] Ding, J., Kim, J. H., Lubetzky, E. and Peres, Y. (2011). Anatomy of a young giant component in the random graph. Random Structures Algorithms 39 139–178.
• [11] Ding, J., Lubetzky, E. and Peres, Y. (2012). Mixing time of near-critical random graphs. Ann. Probab. 40 979–1008.
• [12] Ding, J., Lubetzky, E. and Peres, Y. (2014). Anatomy of the giant component: The strictly supercritical regime. European J. Combin. 35 155–168.
• [13] Durrett, R. (2010). Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics 20. Cambridge University Press, Cambridge.
• [14] Dwass, M. (1969). The total progeny in a branching process and a related random walk. J. Appl. Probab. 6 682–686.
• [15] Fountoulakis, N. and Reed, B. A. (2007). Faster mixing and small bottlenecks. Probab. Theory Related Fields 137 475–486.
• [16] Fountoulakis, N. and Reed, B. A. (2008). The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Structures Algorithms 33 68–86.
• [17] Grimmett, G. and Kesten, H. (1984). Random electrical networks on complete graphs II: Proofs. Unpublished manuscript. Available at arXiv:math/0107068.
• [18] Janson, S., Łuczak, T. and Rucinski, A. (2000). Random Graphs. Wiley, New York.
• [19] Kendall, D. G. (1959). Unitary dilations of Markov transition operators, and the corresponding integral representations for transition-probability matrices. In Probability and Statistics: The Harald Cramér Volume (U. Grenander, ed.). 139–161. Almqvist & Wiksell, Stockholm; Wiley, New York.
• [20] Lindvall, T. (1992). Lectures on the Coupling Method. Wiley, New York. A Wiley-Interscience Publication.
• [21] Lovász, L. and Kannan, R. (1999). Faster mixing via average conductance. In Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999) 282–287. ACM, New York.
• [22] Lubetzky, E. and Sly, A. (2010). Cutoff phenomena for random walks on random regular graphs. Duke Math. J. 153 475–510.
• [23] Łuczak, T. (1990). Component behavior near the critical point of the random graph process. Random Structures Algorithms 1 287–310.
• [24] Lyons, R., Pemantle, R. and Peres, Y. (1995). Ergodic theory on Galton–Watson trees: Speed of random walk and dimension of harmonic measure. Ergodic Theory Dynam. Systems 15 593–619.
• [25] Lyons, R., Pemantle, R. and Peres, Y. (1996). Biased random walks on Galton–Watson trees. Probab. Theory Related Fields 106 249–264.
• [26] Nachmias, A. and Peres, Y. (2008). Critical random graphs: Diameter and mixing time. Ann. Probab. 36 1267–1286.
• [27] Piau, D. (1996). Functional limit theorems for the simple random walk on a supercritical Galton–Watson tree. In Trees (Versailles, 1995) (B. Chauvin, S. Cohen and A. Rouault, eds.). Progress in Probability 40 95–106. Birkhäuser, Basel.
• [28] Riordan, O. and Wormald, N. (2010). The diameter of sparse random graphs. Combin. Probab. Comput. 19 835–926.