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

DOI10.1016/j.spa.2012.05.013zbMath1259.60103arXiv1110.2163MaRDI QIDQ444351

Igor Kortchemski

Publication date: 14 August 2012

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

invariance principles; random trees; scaling limits; conditioned Galton-Watson trees; stable trees

Mathematics Subject Classification ID

05C05: Trees

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

60F17: Functional limit theorems; invariance principles

Related Items

On scaling limits of planar maps with stable face-degrees, On scaling limits of multitype Galton-Watson trees with possibly infinite variance, Asymptotics of trees with a prescribed degree sequence and applications, Vertices with fixed outdegrees in large Galton-Watson trees, A decorated tree approach to random permutations in substitution-closed classes, The Brownian limit of separable permutations, Scaling limits for some random trees constructed inhomogeneously, Cost functionals for large (uniform and simply generated) random trees, Scaling limits of discrete snakes with stable branching, Limits of random tree-like discrete structures, On the maximal offspring in a subcritical branching process, Universal limits of substitution-closed permutation classes, Inverting the cut-tree transform, Limit theorems for conditioned non-generic Galton-Watson trees, Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set, Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees, Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees, Random stable laminations of the disk, Coding multitype forests: Application to the law of the total population of branching forests, Random non-crossing plane configurations: A conditioned Galton-Watson tree approach, Schröder’s problems and scaling limits of random trees, The CRT is the scaling limit of random dissections, Dissecting the circle, at random

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits of random planar maps with large faces
• The continuum random tree. I
• Limit distributions of the number of vertices of a given out-degree in a random forest
• Itô's excursion theory and random trees
• Random trees and applications
• Branching processes in Lévy processes: The exploration process
• Normalized excursion, meander and bridge for stable Lévy processes
• A limit theorem for the contour process of conditioned Galton-Watson trees
• The continuum random tree. III
• Random stable laminations of the disk
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• A Simple Proof of Duquesne’s Theorem on Contour Processes of Conditioned Galton–Watson Trees
• On the genealogy on conditioned stable L\'evy forest
• Random non-crossing plane configurations: A conditioned Galton-Watson tree approach
• On the number of vertices with a given degree in a Galton-Watson tree
• Limit distributions for the number of leaves in a random forest
• Asymptotics of trees with a prescribed degree sequence and applications
• Probability