Record process on the continuum random tree

MaRDI QIDQ2866827zbMATH OpenFDO

Authors Romain Abraham, Jean-François Delmas

Publication date 9 December 2013

Published in ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.3657, http://alea.impa.br/articles/v10/10-10.pdf

zbMATH Keywords

recordscontinuum random treecutting down a tree

Mathematics Subject Classification ID

Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $Theta$ 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 $n$ leaves.

Recommendations

• Random cutting and records in deterministic and random trees
• Fluctuations for the number of records on subtrees of the continuum random tree
• Cutting down trees with a Markov chainsaw
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• The \(k\)-cut model in deterministic and random trees

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
• Random cutting and records in deterministic and random trees
• scientific article; zbMATH DE number 5233601 (Why is no real title available?)
• Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process
• Cutting down trees with a Markov chainsaw
• Fluctuations for the number of records on subtrees of the continuum random tree
• Exit times for an increasing Lévy tree-valued process
• \(k\)-cut model for the Brownian continuum random tree
• The forest associated with the record process on a Lévy tree
• Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
• Pruned discrete random samples
• A construction of a -coalescent via the pruning of binary trees

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)