The vertex-cut-tree of Galton-Watson trees converging to a stable tree
From MaRDI portal
Publication:2354896
DOI10.1214/14-AAP1047zbMath1319.60167arXiv1312.5525OpenAlexW3103463502MaRDI QIDQ2354896
Publication date: 27 July 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5525
Central limit and other weak theorems (60F05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Related Items (12)
Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014. ⋮ Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees ⋮ Growing random graphs with a preferential attachment structure ⋮ Stable graphs: distributions and line-breaking construction ⋮ A binary embedding of the stable line-breaking construction ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ A recursive distributional equation for the stable tree ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ A new combinatorial representation of the additive coalescent ⋮ Percolation on random recursive trees ⋮ \(k\)-cut model for the Brownian continuum random tree ⋮ Inverting the cut-tree transform
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The cut-tree of large Galton-Watson trees and the Brownian CRT
- Cutting down trees with a Markov chainsaw
- Pruning a Lévy continuum random tree
- Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
- The standard additive coalescent
- One-sided local large deviation and renewal theorems in the case of infinite mean
- A limit theorem for the contour process of conditioned Galton-Watson trees
- Self-similar fragmentation derived from the stable tree. I: Splitting at heights
- A fragmentation process connected to Brownian motion
- Self-similar fragmentations
- Probabilistic and fractal aspects of Lévy trees
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
- Conceptual proofs of \(L\log L\) criteria for mean behavior of branching processes
- Fires on trees
- The continuum random tree. III
- The forest associated with the record process on a Lévy tree
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- $\beta$-coalescents and stable Galton-Watson trees
- Random cutting and records in deterministic and random trees
- Cutting down very simple trees
- Random Fragmentation and Coagulation Processes
- Cutting down random trees
This page was built for publication: The vertex-cut-tree of Galton-Watson trees converging to a stable tree