Cutting down trees with a Markov chainsaw

DOI10.1214/13-AAP978zbMath1352.60009arXiv1110.6455OpenAlexW2022069198MaRDI QIDQ473156

Nicolas Broutin, Cecilia Holmgren, Louigi Addario-Berry

Publication date: 21 November 2014

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Galton-Watson treeGromov-Hausdorff convergenceBrownian continuum random treereal tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Functional limit theorems; invariance principles (60F17)

Related Items (21)

Tree limits and limits of random trees ⋮ On moment sequences and mixed Poisson distributions ⋮ Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees ⋮ \(k\)-cut on paths and some trees ⋮ A modification of the random cutting model ⋮ The uncover process for random labeled trees ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Multisource invasion percolation on the complete graph ⋮ Models of random subtrees of a graph ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ The forest associated with the record process on a Lévy tree ⋮ The \(k\)-cut model in deterministic and random trees ⋮ Cutting down trees with a Markov chainsaw ⋮ A new combinatorial representation of the additive coalescent ⋮ The tree search game for two players ⋮ Cutting resilient networks -- complete binary trees ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ \(k\)-cut model for the Brownian continuum random tree ⋮ Inverting the cut-tree transform ⋮ The cut-tree of large recursive trees ⋮ The vertex-cut-tree of Galton-Watson trees converging to a stable tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• Asymptotic fringe distributions for general families of random trees
• Destruction of very simple trees
• Isolating a leaf in rooted trees via random cuttings
• Random trees and applications
• Isolating nodes in recursive trees
• Subdiffusive behavior of random walk on a random cluster
• An introduction to the theory of point processes
• The standard additive coalescent
• Cutting down recursive trees
• Fires on trees
• The continuum random tree. III
• The forest associated with the record process on a Lévy tree
• Random real trees
• 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.
• Probability on Trees and Networks
• Record process on the Continuum Random Tree
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled 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
• Probability with Martingales
• The distribution of the maximum Brownian excursion
• On the Altitude of Nodes in Random Trees
• Brownian bridge asymptotics for random mappings
• Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees
• Random Fragmentation and Coagulation Processes
• Forests of labeled trees
• The distance between points in random trees
• Cutting down random trees
• Probability Theory
• Optimal Transport

This page was built for publication: Cutting down trees with a Markov chainsaw