THE RANGE OF TREE-INDEXED RANDOM WALK
Authors:
- 10 September 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- Vol. 15 (2) , 271-317
Abstract
We provide asymptotics for the range $R_{n}$ of a random walk on the $d$ -dimensional lattice indexed by a random tree with $n$ vertices. Using Kingman’s subadditive ergodic theorem, we prove under general assumptions that $n^{-1}R_{n}$ converges to a constant, and we give conditions ensuring that the limiting constant is strictly positive. On the other hand, in dimension $4$ , and in the case of a symmetric random walk with exponential moments, we prove that $R_{n}$ grows like $n/\!\log n$ . We apply our results to asymptotics for the range of a branching random walk when the initial size of the population tends to infinity.
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees2013
- Itô’s excursion theory and random treesStochastic Processes and their Applications, 2010
- Some properties of the range of super-Brownian motionProbability Theory and Related Fields, 1999
- Multidimensional version of the results of Komlos, Major and Tusnady for vectors with finite exponential momentsESAIM: Probability and Statistics, 1998
- Avoiding-Probabilities For Brownian Snakes and Super-Brownian MotionElectronic Journal of Probability, 1997
- Laws of the iterated logarithm for intersections of random walks on Z4Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 1997
- Conceptual Proofs of $L$ Log $L$ Criteria for Mean Behavior of Branching ProcessesThe Annals of Probability, 1995
- The Range of Stable Random WalksThe Annals of Probability, 1991
- Continuous Martingales and Brownian Motion1991
- One-dimensional Brownian motion and the three-dimensional Bessel processAdvances in Applied Probability, 1975