scientific article; zbMATH DE number 2127740

zbMATH Open1060.05022MaRDI QIDQ3154689FDOQ3154689

Authors: Alois Panholzer 

Publication date: 14 January 2005

Title of this publication is not available (Why is that?)

Recommendations

• Isolating the most recent entry in a random recursive tree by random cuts
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Isolating a leaf in rooted trees via random cuttings
• Isolating nodes in recursive trees
• Destruction of very simple trees
• Multiple isolation of nodes in recursive trees
• Uniform recursive trees: branching structure and simple random downward walk
• Cutting down trees with a Markov chainsaw
• Publication:4939531
• Cut trees in the topological analysis of branching patterns

zbMATH Keywords

recursive treesremoving edges

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (12)

• On the block counting process and the fixation line of the Bolthausen-Sznitman coalescent
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• On Asymptotics of Exchangeable Coalescents with Multiple Collisions
• Asymptotic hitting probabilities for the Bolthausen-Sznitman coalescent
• On the number of collisions in beta(\(2, b\))-coalescents
• The \(k\)-cut model in deterministic and random trees
• On asymptotics of the beta coalescents
• Destruction of very simple trees
• A class of random recursive tree algorithms with deletion
• Asymptotic results concerning the total branch length of the Bolthausen-Sznitman coalescent
• The cut-tree of large recursive trees
• Breakage and restoration in recursive trees

This page was built for publication:

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