The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The asymptotic contour process of a binary tree is a Brownian excursion |
scientific article; zbMATH DE number 90022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The asymptotic contour process of a binary tree is a Brownian excursion |
scientific article; zbMATH DE number 90022 |
Statements
The asymptotic contour process of a binary tree is a Brownian excursion (English)
0 references
16 January 1993
0 references
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.
0 references
random binary tree
0 references
asymptotic Markov process
0 references
Brownian excursion
0 references
