Scaling limits for simple random walks on random ordered graph trees

From MaRDI portal
Publication:3578043

DOI10.1239/AAP/1275055241zbMATH Open1202.60162arXiv1210.5866OpenAlexW2109849732MaRDI QIDQ3578043FDOQ3578043

David A. Croydon

Publication date: 13 July 2010

Published in: Advances in Applied Probability (Search for Journal in Brave)

Abstract: Consider a family of random ordered graph trees (Tn)ngeq1, 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 nightarrowinfty, 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 alpha-stable tree.


Full work available at URL: https://arxiv.org/abs/1210.5866





Cites Work


Cited In (10)


Recommendations





This page was built for publication: Scaling limits for simple random walks on random ordered graph trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578043)