Isolating the most recent entry in a random recursive tree by random cuts

DOI10.1007/BF02936155MaRDI QIDQ1885072zbMATH OpenOpenAlexFDO

Authors Mehri Javanian, Mohammad Q. Vahidi-Asl

Publication date 28 October 2004

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02936155

zbMATH Keywords

recursive tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05)

Recommendations

• Isolating nodes in recursive trees
• Multiple isolation of nodes in recursive trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• The cut-tree of large recursive trees

Cites work

• scientific article; zbMATH DE number 1409903 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3049368 (Why is no real title available?)
• A Probability Model of a Pyramid Scheme
• Cutting down recursive trees
• Distribution of nodes of a tree by degree
• First-passage percolation on the random graph
• Note on the outdegree of a node in random recursive trees
• On the covariance of the level sizes in random recursive trees

Cited in

(4)

• Multiple isolation of nodes in recursive trees
• Cutting edges at random in large recursive trees
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• scientific article; zbMATH DE number 2127740 (Why is no real title available?)

This page was built for publication: Isolating the most recent entry in a random recursive tree by random cuts

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