arXiv Analytics

Sign in

arXiv:1110.2163 [math.PR]AbstractReferencesReviewsResources

Invariance principles for Galton-Watson trees conditioned on the number of leaves

Igor Kortchemski

Published 2011-10-10, updated 2014-11-13Version 4

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for the probability of a Galton-Watson tree having $n$ leaves. Secondly, we let $t_n$ be a critical Galton-Watson tree whose offspring distribution is in the domain of attraction of a stable law, and conditioned on having exactly $n$ leaves. We show that the rescaled Lukasiewicz path and contour function of $t_n$ converge respectively to $X^{exc}$ and $H^{exc}$, where $X^{exc}$ is the normalized excursion of a strictly stable spectrally positive L\'evy process and $H^{exc}$ is its associated continuous-time height function. As an application, we investigate the distribution of the maximum degree in a critical Galton-Watson tree conditioned on having a large number of leaves. We also explain how these results can be generalized to the case of Galton-Watson trees which are conditioned on having a large fixed number of vertices with degree in a given set, thus extending results obtained by Aldous, Duquesne and Rizzolo.

Comments: 46 pages, 2 figures. Published version
Journal: Stochastic Process. Appl. 122 (2012), no. 9, 3126-3172
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1305.6802 [math.PR] (Published 2013-05-29)
Rumor processes in random environment on N and on Galton-Watson trees
arXiv:1910.02367 [math.PR] (Published 2019-10-06)
The frog model on Galton-Watson trees
arXiv:2402.13748 [math.PR] (Published 2024-02-21, updated 2024-09-04)
Nonlinear effects within invariance principles