Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-22T13:02:06.119Z Has data issue: false hasContentIssue false
  • English
  • Français

A quenched central limit theorem for biased random walks on supercritical Galton–Watson trees

Part of: Markov processes Special processes Limit theorems

Published online by Cambridge University Press:  26 July 2018

Adam Bowditch
Adam Bowditch*
Affiliation:
University of Warwick
*
* Current address: Department of Mathematics, National University of Singapore, Block S17, 10 Lower Kent Ridge Road, Singapore 119076. Email address: matamb@nus.edu.sg
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton–Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves was considered. A conjecture of Ben Arous and Fribergh (2016) suggests an upper bound on the bias which we observe to be sharp.

Keywords

Random walkrandom environmentGalton–Watson treefunctional central limit theoremquenchedinvariance principle

MSC classification

Primary: 60F17: Functional limit theorems; invariance principles
Secondary: 60K37: Processes in random environments 60F05: Central limit and other weak theorems 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Type
Research Papers
Information
Journal of Applied Probability , Volume 55 , Issue 2 , June 2018 , pp. 610 - 626
Copyright
Copyright © Applied Probability Trust 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Athreya, K. B. and Ney, P. E. (2004). Branching Processes. Dover, Mineola, NY. Google Scholar
[2]Ben Arous, G. and Fribergh, A. (2016). Biased random walks on random graphs. In Probability and Statistical Physics in St. Petersburg (Proc. Sympos. Pure Math. 91), American Mathematical Society, Providence, RI, pp. 99–153. Google Scholar
[3]Ben Arous, G., Fribergh, A., Gantert, N. and Hammond, A. (2012). Biased random walks on Galton–Watson trees with leaves. Ann. Prob. 40, 280–338. Google Scholar
[4]Bolthausen, E. and Sznitman, A.-S. (2002). On the static and dynamic points of view for certain random walks in random environment. Meth. Appl. Anal. 9, 345–375. Google Scholar
[5]Bowditch, A. (2018). Central limit theorems for biased randomly trapped walks on ℤ. Stoch. Process Appl. Available at https://doi.org/10.1016/j.spa.2018.03.017. Google Scholar
[6]Bowditch, A. (2018). Escape regimes of biased random walks on Galton–Watson trees. Prob. Theory Relat. Fields 170, 685–768. 10.1007/s00440-017-0768-yGoogle Scholar
[7]Dembo, A. and Sun, N. (2012). Central limit theorem for biased random walk on multi-type Galton-Watson trees. Electron. J. Prob. 17, 75. Google Scholar
[8]Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. John Wiley, New York. Google Scholar
[9]Lyons, R., Pemantle, R. and Peres, Y. (1995). Conceptual proofs of LlogL criteria for mean behavior of branching processes. Ann. Prob. 23, 1125–1138. Google Scholar
[10]Lyons, R., Pemantle, R. and Peres, Y. (1996). Biased random walks on Galton–Watson trees. Prob. Theory Relat. Fields 106, 249–264. 10.1007/s004400050064Google Scholar
[11]Peres, Y. and Zeitouni, O. (2008). A central limit theorem for biased random walks on Galton–Watson trees. Prob. Theory Relat. Fields 140, 595–629. 10.1007/s00440-007-0077-yGoogle Scholar
[12]Sznitman, A.-S. (2000). Slowdown estimates and central limit theorem for random walks in random environment. J. Europ. Math. Soc. (JEMS) 2, 93–143. Google Scholar
[13]Whitt, W. (2002). Stochastic-Process Limits. Springer, New York. 10.1007/b97479Google Scholar