The asymptotic contour process of a binary tree is a Brownian excursion (Q1198554): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q585712 / rank
Normal rank
 
Property / author
 
Property / author: Georg Ch. Pflug / rank
Normal rank
 
Property / author
 
Property / author: Walter J. Gutjahr / rank
 
Normal rank
Property / author
 
Property / author: Georg Ch. Pflug / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59255187 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average height of binary trees and other simple trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic distribution of leaf heights in binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limiting common distribution of two leaf heights in a random binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average oscillation of a stack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average shape of simply generated families of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3717966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Level Numbers of <i>t</i>-Ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional Brownian motion and the three-dimensional Bessel process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Average Shape of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation between Brownian bridge and Brownian excursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187050 / rank
 
Normal rank
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
    0 references
    0 references

    Identifiers