The depth first processes of Galton-Watson trees converge to the same Brownian excursion

DOI10.1214/aop/1055425793zbMath1049.05026MaRDI 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

zbMATH Keywords

depth; moderate deviations; Brownian excursions; subtree; Galton-Watson trees; continuum random tree; ladder variable

Mathematics Subject Classification ID

05C05: Trees

60G50: Sums of independent random variables; random walks

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

60F99: Limit theorems in probability theory

Related Items

Ladder variables, internal structure of Galton–Watson trees and finite branching random walks, The CRT is the scaling limit of unordered binary trees, Patterns in Random Permutations Avoiding the Pattern 132, Asymptotics of trees with a prescribed degree sequence and applications, On The Limiting Distributions of the Total Height On Families of Trees, Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations, Rescaled bipartite planar maps converge to the Brownian map, Pattern-avoiding permutations and Brownian excursion. II: Fixed points, Vertices with fixed outdegrees in large Galton-Watson trees, Exchangeable interval hypergraphs and limits of ordered discrete structures, Limit of normalized quadrangulations: the Brownian map, The range of tree-indexed random walk in low dimensions, Itô's excursion theory and random trees, On \(q\)-functional equations and excursion moments, Height and contour processes of Crump-Mode-Jagers forests. I: general distribution and scaling limits in the case of short edges, Heavy subtrees of Galton-Watson trees with an application to Apollonian networks, Tightness results for infinite-slit limits of the chordal Loewner equation, The boundary of random planar maps via looptrees, The \(k\)-cut model in deterministic and random trees, An analysis of budgeted parallel search on conditional Galton-Watson trees, The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees, Height and contour processes of Crump-Mode-Jagers forests. II: the Bellman-Harris universality class, The continuum limit of critical random graphs, Invariance principles for random bipartite planar maps, Random real trees, The lineage process in Galton-Watson trees and globally centered discrete snakes, Reinforced weak convergence of stochastic processes, Convergence of discrete snakes, Schröder’s problems and scaling limits of random trees, Scaling Limits of Random Trees and Random Graphs

Cites Work

• Unnamed Item
• 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
• Probability Inequalities for Sums of Independent Random Variables
• The Multiplicative Process
• Parking functions, empirical processes, and the width of rooted labeled trees