Marked excursions and random trees
This article is devoted to the study of the properties of a marked Brownian excursion, and an embedding of a branching tree in an excursion with marks. The embedding depends upon the heights of the excursion at the various mark times, and the heights of minima between consecutive marks. The resulting tree is a critical binary tree with an independent branching structure. The construction also gives rise to a natural connection between a Brownian excursion with at least one mark, and a family of Brownian excursions each with exactly one mark. For the entire collection see [Zbl 0940.00007].
- Markov Processes and Ramsey Theory for Trees
- scientific article; zbMATH DE number 1490103
- Trees and Markov convexity
- Trees and Markov convexity
- Itô's excursion theory and random trees
- Large deviations of Markov chains indexed by random trees
- Markov chains indexed by trees
- scientific article; zbMATH DE number 123295
- scientific article; zbMATH DE number 1419384
This page was built for publication: Marked excursions and random trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501617)