The depth first processes of Galton-Watson trees converge to the same Brownian excursion
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 (45)
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