The asymptotic contour process of a binary tree is a Brownian excursion

DOI10.1016/0304-4149(92)90147-IzbMath0757.60074OpenAlexW1964320481WikidataQ59255187 ScholiaQ59255187MaRDI QIDQ1198554

Georg Ch. Pflug, Walter J. Gutjahr

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0304-4149(92)90147-i

zbMATH Keywords

Brownian excursionrandom binary treeasymptotic Markov process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Brownian motion (60J65)

Related Items (4)

Strata of random mappings---a combinatorial approach ⋮ The depth first processes of Galton-Watson trees converge to the same Brownian excursion ⋮ The asymptotic distribution of leaf heights in binary trees ⋮ Area Limit Laws for Symmetry Classes of Staircase Polygons

Cites Work

• The average height of binary trees and other simple trees
• The asymptotic distribution of leaf heights in binary trees
• A relation between Brownian bridge and Brownian excursion
• On the average oscillation of a stack
• On Level Numbers of t-Ary Trees
• On the average shape of simply generated families of trees
• On the Average Shape of Binary Trees
• The limiting common distribution of two leaf heights in a random binary tree
• One-dimensional Brownian motion and the three-dimensional Bessel process
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic contour process of a binary tree is a Brownian excursion