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

Abstract

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évy 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.

46 pages, 2 figures. Published version

References in corpus (1)

• A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees

Cited by in corpus (19)

• Random stable looptrees
• Local limits of conditioned Galton-Watson trees I: the infinite spine case
• A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
• Universal limits of substitution-closed permutation classes
• Scaling limits of random bipartite planar maps with a prescribed degree sequence
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• A decorated tree approach to random permutations in substitution-closed classes
• Random stable laminations of the disk
• Triangulating stable laminations
• On scaling limits of planar maps with stable face-degrees
• On scaling limits of random trees and maps with a prescribed degree sequence
• Scaling limits of discrete snakes with stable branching
• Random Permutations -- A geometric point of view
• A branching process with coalescence to model random phylogenetic networks
• Large deviation Local Limit Theorems and limits of biconditioned Trees and Maps
• Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
• Scaling limits of slim and fat trees
• A branching process approach to level-$k$ phylogenetic networks
• Random stable type minimal factorizations of the $n$-cycle