Cutting down very simple trees
From MaRDI portal
Publication:3431999
DOI10.2989/16073600609486160zbMath1120.05020OpenAlexW2074639950MaRDI QIDQ3431999
Publication date: 13 April 2007
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073600609486160
Related Items (24)
On moment sequences and mixed Poisson distributions ⋮ Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent ⋮ The cut-tree of large Galton-Watson trees and the Brownian CRT ⋮ Fringe analysis of plane trees related to cutting and pruning ⋮ Fires on trees ⋮ Tree evolution processes for bucket increasing trees ⋮ 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 ⋮ Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ On the number of jumps of random walks with a barrier ⋮ The \(k\)-cut model in deterministic and random trees ⋮ Cutting down trees with a Markov chainsaw ⋮ A weakly 1-stable distribution for the number of random records and cuttings in split trees ⋮ A new combinatorial representation of the additive coalescent ⋮ Enumeration results for alternating tree families ⋮ Level of nodes in increasing trees revisited ⋮ Parking function varieties for combinatorial tree models ⋮ A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree ⋮ Inverting the cut-tree transform ⋮ The cut-tree of large recursive trees ⋮ Sizes of the largest clusters for supercritical percolation on random recursive trees ⋮ The vertex-cut-tree of Galton-Watson trees converging to a stable tree
This page was built for publication: Cutting down very simple trees
