A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
From MaRDI portal
Publication:3633016
DOI10.1002/rsa.20233zbMath1187.05068OpenAlexW4240348261MaRDI QIDQ3633016
Martin Möhle, Michael Drmota, Aleksander M. Iksanov, Uwe Roesler
Publication date: 16 June 2009
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20233
Related Items (28)
Stochastic analysis of the extra clustering model for animal grouping ⋮ Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent ⋮ On the number of collisions in beta(\(2, b\))-coalescents ⋮ Asymptotic results for coalescent processes without proper frequencies and applications to the two-parameter Poisson-Dirichlet coalescent ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ \(k\)-cut on paths and some trees ⋮ Fires on large recursive trees ⋮ Cutting Edges at Random in Large Recursive Trees ⋮ 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 ⋮ On the number of allelic types for samples taken from exchangeable coalescents with mutation ⋮ The total path length of split trees ⋮ On Asymptotics of the Beta Coalescents ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Percolation on random recursive trees ⋮ Cutting resilient networks -- complete binary trees ⋮ Random Records and Cuttings in Binary Search Trees ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ Weak limits for the largest subpopulations in Yule processes with high mutation probabilities ⋮ On Λ-Coalescents with Dust Component ⋮ Λ-coalescents: a survey ⋮ Total internal and external lengths of the Bolthausen-Sznitman coalescent ⋮ Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent ⋮ Inverting the cut-tree transform ⋮ The cut-tree of large recursive trees ⋮ Sizes of the largest clusters for supercritical percolation on random recursive trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Destruction of very simple trees
- The Bernoulli sieve
- On the analysis of stochastic divide and conquer algorithms
- Cutting down recursive trees
- On the contraction method with degenerate limit equation.
- Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent
- A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
- Random cutting and records in deterministic and random trees
- Cutting down very simple trees
This page was built for publication: A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
