Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T18:12:36.108Z Has data issue: false hasContentIssue false
  • English
  • Français

Scaling limits for simple random walks on random ordered graph trees

Part of: Markov processes Stochastic processes Special processes

Published online by Cambridge University Press:  01 July 2016

D. A. Croydon
D. A. Croydon*
Affiliation:
University of Warwick
*
∗ Postal address: Department of Statistics, University of Warwick, Coventry CV4 7AL, UK. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Consider a family of random ordered graph trees (Tn)n≥1, where Tn has n vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled appropriately as n → ∞, then the simple random walks on the graph trees have the Brownian motion on the Brownian continuum random tree as their scaling limit. Here, this result is extended to demonstrate the existence of a diffusion scaling limit whenever the volume measure on the limiting real tree is nonatomic, supported on the leaves of the limiting tree, and satisfies a polynomial lower bound for the volume of balls. Furthermore, as an application of this generalisation, it is established that the simple random walks on a family of Galton-Watson trees with a critical infinite variance offspring distribution, conditioned on the total number of offspring, can be rescaled to converge to the Brownian motion on a related α-stable tree.

Keywords

Branching processrandom graph treerandom walkscaling limitα-stable tree

MSC classification

Primary: 60K37: Processes in random environments
Secondary: 60G99: None of the above, but in this section 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 42 , Issue 2 , June 2010 , pp. 528 - 558
Copyright
Copyright © Applied Probability Trust 2010 

References

Aldous, D. (1991). The continuum random tree. II. An overview. In Stochastic Analysis (Durham, 1990; London Math. Soc. Lecture Note Ser. 167), Cambridge University Press, pp. 23–70.Google Scholar
Aldous, D. (1993). The continuum random tree. III. Ann. Prob. 21, 248–289.CrossRefGoogle Scholar
Billingsley, P. (1999). Convergence of Probability Measures, 2nd edn. John Wiley, New York.Google Scholar
Blumenthal, R. M. and Getoor, R. K. (1968). Markov Processes and Potential Theory (Pure Appl. Math. 29). Academic Press, New York.Google Scholar
Borodin, A. N. (1981). The asymptotic behavior of local times of recurrent random walks with finite variance. Teor. Veroyat. Primen. 26, 769–783.Google Scholar
Croydon, D. A. (2007). Heat kernel fluctuations for a resistance form with non-uniform volume growth. Proc. London Math. Soc. 94, 672–694.CrossRefGoogle Scholar
Croydon, D. A. (2008). Convergence of simple random walks on random discrete trees to Brownian motion on the continuum random tree. Ann. Inst. H. Poincaré Prob. Statist. 44, 987–1019.CrossRefGoogle Scholar
Croydon, D. A. (2008). Volume growth and heat kernel estimates for the continuum random tree. Prob. Theory Relat. Fields 140, 207–238.CrossRefGoogle Scholar
Croydon, D. A. and Hambly, B. M. (2008). Local limit theorems for sequences of simple random walks on graphs. Potential Analysis 29, 351–389.CrossRefGoogle Scholar
Croydon, D. and Kumagai, T. (2008). Random walks on Galton–Watson trees with infinite variance offspring distribution conditioned to survive. Electron. J. Prob. 13, 1419–1441.CrossRefGoogle Scholar
Dudley, R. M. (1973). Sample functions of the Gaussian process. Ann. Prob. 1, 66–103.CrossRefGoogle Scholar
Duquesne, T. (2003). A limit theorem for the contour process of conditioned Galton–Watson trees. Ann. Prob. 31, 996–1027.CrossRefGoogle Scholar
Duquesne, T. and Le Gall, J.-F. (2005). Probabilistic and fractal aspects of Lévy trees. Prob. Theory Relat. Fields 131, 553–603.CrossRefGoogle Scholar
Duquesne, T. and Le Gall, J.-F. (2006). The Hausdorff measure of stable trees. ALEA 1, 393–415.Google Scholar
Fukushima, M., Ōshima, Y. and Takeda, M. (1994). Dirichlet Forms and Symmetric Markov Processes (de Gruyter Stud. Math. 19). Walter de Gruyter, Berlin.Google Scholar
Kallenberg, O. (2002). Foundations of Modern Probability, 2nd edn. Springer, New York.Google Scholar
Kigami, J. (1995). Harmonic calculus on limits of networks and its application to dendrites. J. Funct. Anal. 128, 48–86.Google Scholar
Kumagai, T. (2004). Heat kernel estimates and parabolic Harnack inequalities on graphs and resistance forms. Publ. Res. Inst. Math. Sci. 40, 793–818.Google Scholar
Le Gall, J.-F. (2006). Random real trees. Ann. Fac. Sci. Toulouse Math. 15, 35–62.CrossRefGoogle Scholar
Marcus, M. B. and Rosen, J. (1992). Sample path properties of the local times of strongly symmetric Markov processes via Gaussian processes. Ann. Prob. 20, 1603–1684.Google Scholar