Inverting the cut-tree transform

DOI10.1214/18-AIHP921zbMath1467.60014arXiv1606.04825OpenAlexW2977064352MaRDI QIDQ2337828

Louigi Addario-Berry, Daphné Dieuleveut, Christina Goldschmidt

Publication date: 20 November 2019

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.04825

zbMATH Keywords

fragmentationcut-tree\( \mathbb{R} \)-tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Stable stochastic processes (60G52) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (1)

A recursive distributional equation for the stable tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• Invariance principles for Galton-Watson trees conditioned on the number of leaves
• Cutting down trees with a Markov chainsaw
• A survey of max-type recursive distributional equations
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The continuum random tree. I
• Rayleigh processes, real trees, and root growth with re-grafting
• Spinal partitions and invariance under re-rooting of continuum random trees
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Destruction of very simple trees
• Cluster growth in the dynamical Erdős-Rényi process with forest fires
• The Brownian continuum random tree as the unique solution to a fixed point equation
• Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
• Collapsing of Riemannian manifolds and eigenvalues of Laplace operator
• The standard additive coalescent
• Recursive self-similarity for random trees, random triangulations and Brownian excursion
• Self-similar fragmentation derived from the stable tree. I: Splitting at heights
• Self-similar fragmentations
• Probabilistic and fractal aspects of Lévy trees
• Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
• Cutting down recursive trees
• Fires on trees
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• The cut-tree of large recursive trees
• Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree
• The continuum random tree. III
• Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
• Reversing the cut tree of the Brownian continuum random tree
• The forest associated with the record process on a Lévy tree
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Subtree prune and regraft: a reversible real tree-valued Markov process
• A line-breaking construction of the stable trees
• Random Records and Cuttings in Binary Search Trees
• Random cutting and records in deterministic and random trees
• Cutting down very simple trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Tessellations of random maps of arbitrary genus
• A family of random trees with random edge lengths
• Fixed points of the smoothing transformation
• Cutting Edges at Random in Large Recursive Trees
• Cutting down random trees
• Probability

This page was built for publication: Inverting the cut-tree transform