Invariance principles for Galton-Watson trees conditioned on the number of leaves
From MaRDI portal
Publication:444351
DOI10.1016/j.spa.2012.05.013zbMath1259.60103arXiv1110.2163OpenAlexW2006252824MaRDI QIDQ444351
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
Trees (05C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Functional limit theorems; invariance principles (60F17)
Related Items (35)
Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees ⋮ On scaling limits of random trees and maps with a prescribed degree sequence ⋮ Dissecting the circle, at random ⋮ Random stable-type minimal factorizations of the n-cycle ⋮ The CRT is the scaling limit of random dissections ⋮ Random non-crossing plane configurations: A conditioned Galton-Watson tree approach ⋮ The Brownian limit of separable permutations ⋮ Scaling limits of discrete snakes with stable branching ⋮ Schröder’s problems and scaling limits of random trees ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees ⋮ Scaling limits of slim and fat trees ⋮ Limits of random tree-like discrete structures ⋮ A branching process with coalescence to model random phylogenetic networks ⋮ A binary embedding of the stable line-breaking construction ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Decorated stable trees ⋮ Large deviation local limit theorems and limits of biconditioned planar maps ⋮ On the maximal offspring in a subcritical branching process ⋮ Parabolic Anderson model on critical Galton-Watson trees in a Pareto environment ⋮ Universal limits of substitution-closed permutation classes ⋮ Random stable laminations of the disk ⋮ Cost functionals for large (uniform and simply generated) random trees ⋮ Scaling limits for some random trees constructed inhomogeneously ⋮ Asymptotics of trees with a prescribed degree sequence and applications ⋮ On scaling limits of planar maps with stable face-degrees ⋮ Coding multitype forests: Application to the law of the total population of branching forests ⋮ Duality of random planar maps via percolation ⋮ On scaling limits of multitype Galton-Watson trees with possibly infinite variance ⋮ Vertices with fixed outdegrees in large Galton-Watson trees ⋮ A decorated tree approach to random permutations in substitution-closed 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
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
- 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
- A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree
- Asymptotics of trees with a prescribed degree sequence and applications
- Probability
This page was built for publication: Invariance principles for Galton-Watson trees conditioned on the number of leaves