\(k\)-cut model for the Brownian continuum random tree

DOI10.1214/21-ECP417zbMath1493.60024arXiv2007.11080OpenAlexW3186603345MaRDI QIDQ2064820

Minmin Wang

Publication date: 6 January 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

Brownian excursioncontinuum random treerandom cut on random tree

Mathematics Subject Classification ID

Combinatorial probability (60C05) Self-similar stochastic processes (60G18) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Cites Work

• The cut-tree of large Galton-Watson trees and the Brownian CRT
• Cutting down trees with a Markov chainsaw
• On intrinsic geometry of surfaces in normed spaces
• Random trees and applications
• The standard additive coalescent
• The \(k\)-cut model in deterministic and random trees
• 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
• \(k\)-cut on paths and some trees
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Record process on the Continuum Random Tree
• Random cutting and records in deterministic and random trees
• Tessellations of random maps of arbitrary genus
• Cutting down random trees