A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree

Recommendations

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
Isolating nodes in recursive trees
Multiple isolation of nodes in recursive trees
Isolating the most recent entry in a random recursive tree by random cuts

Cites work

scientific article; zbMATH DE number 2127735 (Why is no real title available?)
scientific article; zbMATH DE number 2127740 (Why is no real title available?)
scientific article; zbMATH DE number 2046075 (Why is no real title available?)
A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent
Cutting down recursive trees
Cutting down very simple trees
Destruction of very simple trees
On the analysis of stochastic divide and conquer algorithms
On the contraction method with degenerate limit equation.
Random cutting and records in deterministic and random trees
The Bernoulli sieve

Cited in

(35)

Inversions in split trees and conditional Galton-Watson trees
The fluctuations of the giant cluster for percolation on random split trees
A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
On the number of allelic types for samples taken from exchangeable coalescents with mutation
Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent
Total internal and external lengths of the Bolthausen-Sznitman coalescent
Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent
\(k\)-cut on paths and some 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
Asymptotic results for coalescent processes without proper frequencies and applications to the two-parameter Poisson-Dirichlet coalescent
Multiple isolation of nodes in recursive trees
Asymptotic cost of cutting down random free trees
scientific article; zbMATH DE number 6683495 (Why is no real title available?)
Random records and cuttings in binary search trees
Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
The total path length of split trees
On the number of collisions in beta(\(2, b\))-coalescents
Fires on large recursive trees
Compaction for two models of logarithmic‐depth trees: Analysis and experiments
A weakly 1-stable distribution for the number of random records and cuttings in split trees
\(\Lambda\)-coalescents: a survey
Sizes of the largest clusters for supercritical percolation on random recursive trees
Stochastic analysis of the extra clustering model for animal grouping
On asymptotics of the beta coalescents
Inverting the cut-tree transform
Percolation on random recursive trees
Cut-Set Sums and Tree Processes
On \(\Lambda \)-coalescents with dust component
Isolating the most recent entry in a random recursive tree by random cuts
Cutting edges at random in large recursive trees
The \(k\)-cut model in deterministic and random trees
Cutting down trees with a Markov chainsaw
The cut-tree of large recursive trees
Cutting resilient networks -- complete binary 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633016)