The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-4149(92)90147-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964320481 / rank | |||
Normal rank | |||
Latest revision as of 10:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The asymptotic contour process of a binary tree is a Brownian excursion |
scientific article |
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
