Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
From MaRDI portal
Publication:2405112
DOI10.3150/16-BEJ813zbMath1388.60036arXiv1408.0144OpenAlexW1803205537MaRDI QIDQ2405112
Publication date: 21 September 2017
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0144
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)
Related Items
Gromov-Hausdorff-Prokhorov convergence of vertex cut-trees of \(n\)-leaf Galton-Watson trees ⋮ A modification of the random cutting model ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ A new combinatorial representation of the additive coalescent ⋮ \(k\)-cut model for the Brownian continuum random tree ⋮ Inverting the cut-tree transform
This page was built for publication: Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees