The asymptotic contour process of a binary tree is a Brownian excursion
type: Item
instance of: scholarly article
title: The asymptotic contour process of a binary tree is a Brownian excursion
zbMATH Open document ID: 0757.60074
DOI: 10.1016/0304-4149(92)90147-I
published in: Stochastic Processes and their Applications
publication date: 1993-01-16T00:00:00Z
review text: By appropriately normalizing the sequence of leaf heights of a random binary tree, an asymptotic Markov process is obtained which is identical in distribution to a Brownian excursion.
Mathematics Subject Classification ID: 60J65
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 90022
zbMATH Keywords: random binary tree
zbMATH Keywords: asymptotic Markov process
zbMATH Keywords: Brownian excursion
author: Walter J. Gutjahr
author: Georg Ch. Pflug
Wikidata QID: Q59255187
MaRDI profile type: Publication
cites work: Q5560061
cites work: The average height of binary trees and other simple trees
cites work: Q3987046
cites work: The asymptotic distribution of leaf heights in binary trees
cites work: The limiting common distribution of two leaf heights in a random binary tree
cites work: Q5332526
cites work: On the average oscillation of a stack
cites work: Q3779735
cites work: Q3765796
cites work: Q3317124
cites work: On the average shape of simply generated families of trees
cites work: Q4057549
cites work: Q3717966
cites work: On Level Numbers of t-Ary Trees
cites work: One-dimensional Brownian motion and the three-dimensional Bessel process
cites work: Q3944022
cites work: On the Average Shape of Binary Trees
cites work: A relation between Brownian bridge and Brownian excursion
cites work: Q4187050
full work available at URL: 0304-4149(92)90147-i
OpenAlex ID: W1964320481
description: scientific article; zbMATH DE number 90022