Random records and cuttings in binary search trees

DOI10.1017/S096354830999068XMaRDI QIDQ3058297zbMATH OpenOpenAlexFDO

Authors Cecilia Holmgren

Publication date 19 November 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096354830999068x

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Limit theorems in probability theory (60F99)

Recommendations

• A weakly 1-stable distribution for the number of random records and cuttings in split trees
• scientific article; zbMATH DE number 6683495
• scientific article; zbMATH DE number 2127735
• Random cutting and records in deterministic and random trees
• scientific article; zbMATH DE number 7703259

Cites work

• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• A note on the height of binary search trees
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Cutting down random trees
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Probability: A Graduate Course
• Quicksort asymptotics
• Random cutting and records in deterministic and random trees
• The profile of binary search trees

Cited in

(20)

• Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
• The \(k\)-cut model in deterministic and random trees
• Cutting resilient networks -- complete binary trees
• Inverting the cut-tree transform
• The cut-tree of large recursive trees
• \(k\)-cut on paths and some trees
• Sizes of the largest clusters for supercritical percolation on random recursive trees
• scientific article; zbMATH DE number 6683495 (Why is no real title available?)
• A weakly 1-stable distribution for the number of random records and cuttings in split trees
• scientific article; zbMATH DE number 2127735 (Why is no real title available?)
• Random cutting and records in deterministic and random trees
• Randomness Preserving Deletions on Special Binary Search Trees
• The fluctuations of the giant cluster for percolation on random split trees
• Cutting edges at random in large recursive trees
• A modification of the random cutting model
• scientific article; zbMATH DE number 7703259 (Why is no real title available?)
• Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
• The total path length of split trees
• Quenched worst-case scenario for root deletion in targeted cutting of random recursive trees
• Convergence of bi-measure \(\mathbb{R}\)-trees and the pruning process

This page was built for publication: Random records and cuttings in binary search trees

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