The depth first processes of Galton-Watson trees converge to the same Brownian excursion
From MaRDI portal
Publication:1431505
DOI10.1214/aop/1055425793zbMath1049.05026OpenAlexW1978667133MaRDI QIDQ1431505
Abdelkader Mokkadem, Jean-François Marckert
Publication date: 10 June 2004
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aop/1055425793
depthmoderate deviationsBrownian excursionssubtreeGalton-Watson treescontinuum random treeladder variable
Trees (05C05) Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Limit theorems in probability theory (60F99)
Related Items
Rescaled bipartite planar maps converge to the Brownian map ⋮ On scaling limits of random trees and maps with a prescribed degree sequence ⋮ Random stable-type minimal factorizations of the n-cycle ⋮ Height and contour processes of Crump-Mode-Jagers forests. I: general distribution and scaling limits in the case of short edges ⋮ Parameterised branching processes: a functional version of Kesten \& Stigum theorem ⋮ Limit of normalized quadrangulations: the Brownian map ⋮ Schröder’s problems and scaling limits of random trees ⋮ The range of tree-indexed random walk in low dimensions ⋮ On breadth‐first constructions of scaling limits of random graphs and random unicellular maps ⋮ Convergence of blanket times for sequences of random walks on critical random graphs ⋮ Scaling limits of slim and fat trees ⋮ Height and contour processes of Crump-Mode-Jagers forests. II: the Bellman-Harris universality class ⋮ A branching process with coalescence to model random phylogenetic networks ⋮ A phase transition in block-weighted random maps ⋮ The continuum limit of critical random graphs ⋮ Models of random subtrees of a graph ⋮ Large deviation local limit theorems and limits of biconditioned planar maps ⋮ On random trees and forests ⋮ The boundary of random planar maps via looptrees ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Heavy subtrees of Galton-Watson trees with an application to Apollonian networks ⋮ The \(k\)-cut model in deterministic and random trees ⋮ Scaling Limits of Random Trees and Random Graphs ⋮ Invariance principles for random bipartite planar maps ⋮ Random real trees ⋮ Tightness results for infinite-slit limits of the chordal Loewner equation ⋮ Pattern-avoiding permutations and Brownian excursion. II: Fixed points ⋮ The lineage process in Galton-Watson trees and globally centered discrete snakes ⋮ Asymptotics of trees with a prescribed degree sequence and applications ⋮ Reinforced weak convergence of stochastic processes ⋮ Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations ⋮ Itô's excursion theory and random trees ⋮ Scaling limit of triangulations of polygons ⋮ The CRT is the scaling limit of unordered binary trees ⋮ On \(q\)-functional equations and excursion moments ⋮ On The Limiting Distributions of the Total Height On Families of Trees ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ An analysis of budgeted parallel search on conditional Galton-Watson trees ⋮ Ladder variables, internal structure of Galton–Watson trees and finite branching random walks ⋮ Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions ⋮ The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees ⋮ Vertices with fixed outdegrees in large Galton-Watson trees ⋮ Exchangeable interval hypergraphs and limits of ordered discrete structures ⋮ Convergence of discrete snakes ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The continuum random tree. I
- The asymptotic contour process of a binary tree is a Brownian excursion
- Weak convergence to Brownian meander and Brownian excursion
- Brownian excursion conditioned on its local time
- Branching processes in Lévy processes: The exploration process
- Limit distributions for queues and random rooted trees
- A LIFO queue in heavy traffic
- On the behavior of LIFO preemptive resume queues in heavy traffic
- The continuum random tree. III
- Patterns and pattern-matching in trees: An analysis
- Excursion and meander in random walk
- The distribution of the maximum Brownian excursion
- On the Altitude of Nodes in Random Trees
- The height distribution of leaves in rooted trees
- On the profile of random trees
- Probability Inequalities for Sums of Independent Random Variables
- The Multiplicative Process
- Parking functions, empirical processes, and the width of rooted labeled trees
This page was built for publication: The depth first processes of Galton-Watson trees converge to the same Brownian excursion