The forest associated with the record process on a Lévy tree
From MaRDI portal
Publication:2447720
Abstract: We perform a pruning procedure on a L'evy tree and instead of throwing away the removed sub-tree, we regraft it on a given branch (not related to the L'evy tree). We prove that the tree constructed by regrafting is distributed as the original L'evy tree, generalizing a result where only Aldous's tree is considered. As a consequence, we obtain that the quantity which represents in some sense the number of cuts needed to isolate the root of the tree, is distributed as the height of a leaf picked at random in the L'evy tree.
Recommendations
Cites work
- \(\mathbb{R}\)-trees and symmetric differences of sets
- \(T\)-theory: An overview
- A continuum-tree-valued Markov process
- A limit theorem for the contour process of conditioned Galton-Watson trees
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees
- Branching processes in Lévy processes: The exploration process
- Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
- Cutting down random trees
- Cutting down trees with a Markov chainsaw
- Dislocation measure of the fragmentation of a general Lévy tree
- Exit times for an increasing Lévy tree-valued process
- Fragmentation at height associated with Lévy processes
- scientific article; zbMATH DE number 1535858 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- Introductory lectures on fluctuations of Lévy processes with applications.
- Probabilistic and fractal aspects of Lévy trees
- Pruning a Lévy continuum random tree
- Pruning Galton-Watson trees and tree-valued Markov processes
- Random cutting and records in deterministic and random trees
- Random trees and applications
- Rayleigh processes, real trees, and root growth with re-grafting
- Record process on the continuum random tree
- Subtree prune and regraft: a reversible real tree-valued Markov process
- The cut-tree of large Galton-Watson trees and the Brownian CRT
- The standard additive coalescent
- Tree-valued Markov chains derived from Galton-Watson processes
Cited in
(11)- A tree-valued Markov process associated with an admissible family of branching mechanisms
- Cost functionals for large (uniform and simply generated) random trees
- Global regime for general additive functionals of conditioned Bienaymé-Galton-Watson trees
- Zooming in at the root of the stable tree
- Exit times for an increasing Lévy tree-valued process
- Time to most recent common ancestor for stationary continuous state branching processes with immigration
- Inverting the cut-tree transform
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
- Cutting down trees with a Markov chainsaw
- Pruning a Lévy continuum random tree
- Pruning, cut trees, and the reconstruction problem
This page was built for publication: The forest associated with the record process on a Lévy tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447720)