The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q59255187, #quickstatements; #temporary_batch_1708557319324 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59255187 / rank | |||
Normal rank | |||
Revision as of 00:42, 22 February 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
