The asymptotic contour process of a binary tree is a Brownian excursion
The contour process of a random binary tree t with n internal nodes is defined as the polygonal function constructed from the heights of the leaves of t (normalized by ). We show that, as n --> [infinity], the limiting contour process is identical in distribution to a Brownian excursion.
Year of publication: |
1992
|
---|---|
Authors: | Gutjahr, W. ; Pflug, G. Ch. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 41.1992, 1, p. 69-89
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Configurations of Series-Parallel Networks with Maximum Reliability.
Gutjahr, W., (1993)
-
Estimating qualifications in a self-evaluating group
Bomze, I., (1995)
-
Modeling, measuring and managing risk
Pflug, Georg, (2007)
- More ...