Scaling limit for local times and return times of a randomly biased walk on a Galton-Watson tree (2310.07278v2)
Abstract: We consider a null recurrent random walk $\mathbb{X}$ on a super-critical Galton Watson marked tree $\mathbb{T}$ in the (sub-)diffusive regime. We are interested in the asymptotic behaviour of the local time of its root at $n$, which is the total amount of time spent by the random walk $\mathbb{X}$ on the root of $\mathbb{T}$ up to the time $n$, and in its $n$-th return time to the root of $\mathbb{T}$. We show that properly renormalized, this local time and this $n$-th return time respectively converge in law to the maximum and to an hitting time of some stable L\'evy process. This paper aims in particular to extent the results of Y. Hu [Hu17].
- P. Andreoletti and P. Debs. The number of generations entirely visited for recurrent random walks on random environment. J. Theoret. Probab., 27: 518 – 538, 2014.
- The heavy range of randomly biased walks on trees. Stochastic Processes and their Applications, 130(2):962 – 999, 2020.
- E. Aïdékon and L. de Raphélis. Scaling limit of the recurrent biased random walk on a Galton-Watson tree. Probability Theory and Related Fields, 169(3):643–666, 2017.
- Biased random walks on Galton–Watson trees with leaves. The Annals of Probability, 40(1):280 – 338, 2012.
- E. Aïdékon. Transient random walks in random environment on a Galton-Watson tree. Probability Theory and Related, 142(3):525–559, 2008.
- Elie Aïdékon. Speed of the biased random walk on a galton–watson tree. Probability Theory and Related Fields, 159(3):597–617, 2014.
- P. Billingsley. Convergence of Probability Measures, Second Edition. John Wiley Sons, 1999.
- N. H. Bingham. Maxima of sums of random variables and suprema of stable processes. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 26(4):273–296, Dec 1973.
- Loïc de Raphélis. Scaling limit of multitype Galton–Watson trees with infinitely many types. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, 53(1):200 – 225, 2017.
- Loïc de Raphélis. Scaling limit of the subdiffusive random walk on a Galton–Watson tree in random environment. The Annals of Probability, 50(1):339 – 396, 2022.
- G. Faraud. A central limit theorem for random walk in a random environment on marked Galton-Watson trees. Electronic Journal of Probability, 16(6):174–215, 2011.
- W. Feller. An Introduction to Probability Theory, Vol. 2. Wiley, New York, NY, second edition, 1971.
- Almost sure convergence for stochastically biased random walks on trees. Probab. Theory Relat. Fields, 154:621–660, 2011.
- Y. Hu and Z. Shi. Slow movement of recurrent random walk in random environment on a regular tree. Ann. Probab., 35:1978–1997, 2007.
- Y. Hu and Z. Shi. A subdiffusive behavior of recurrent random walk in random environment on a regular tree. Probab. Theory Related Fields, 138:521–549, 2007.
- The slow regime of randomly biased walks on trees. Ann. Probab., 44(6):3893–3933, 2016.
- Y. Hu. Local times of subdiffusive biased walks on trees. J. of Theoret. Probab., 30(2):529–550, 2017. (See https://arxiv.org/abs/1412.4507v2 for the corrected version, 2019).
- Quansheng Liu. On generalized multiplicative cascades. Stochastic Processes and their Applications, 86(2):263–286, 2000.
- Random walk in a random environment and first-passage percolation on trees. Annals of Probability, 20:125–136, 1992.
- Biased random walks on Galton-Watson trees. Probability Theory and Related Fields, 106, 10 1996.
- Ergodic theory on Galton-Watson trees: Speed of random walk and dimension of harmonic measure. Ergodic Theory and Dynamical Systems, 15, 10 1996.
- R. Lyons. Random walks and percolation on trees. Ann. Probab., 18:931–958, 1990.
- R. Lyons. Random walks, capacity and percolation on trees. Ann. Probab., 20:2043–2088, 1992.
- V. M. Zolotarev. The first passage time of a level and the behavior at infinity for a class of processes with independent increments. Theory of Probability & Its Applications, 9(4):653–662, 1964.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.