Record process on the continuum random tree
From MaRDI portal
Abstract: By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit distribution of the number of cuts needed to isolate the root in a critical Galton-Watson tree. We also prove that this random variable can be obtained as the a.s. limit of the number of cuts needed to cut down the subtree of the continuum tree spanned by leaves.
Recommendations
Cited in
(13)- Applications of the theory of records in the study of random trees
- Cost functionals for large (uniform and simply generated) random trees
- \(k\)-cut model for the Brownian continuum random tree
- Exit times for an increasing Lévy tree-valued process
- Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
- The forest associated with the record process on a Lévy tree
- A construction of a -coalescent via the pruning of binary trees
- Fluctuations for the number of records on subtrees of the continuum random tree
- Random cutting and records in deterministic and random trees
- Cutting down trees with a Markov chainsaw
- Pruned discrete random samples
- scientific article; zbMATH DE number 5233601 (Why is no real title available?)
- Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process
This page was built for publication: Record process on the continuum random tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866827)