A hooray for Poisson approximation

zbMATH Open1099.68777MaRDI QIDQ5485328FDOQ5485328

Authors Rudolf Grübel

Publication date 29 August 2006

zbMATH Keywords

binary search treemultiplicity of maximatree profile

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximations to statistical distributions (nonasymptotic) (62E17) Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• Poisson approximations for functionals of random trees
• A note on Poisson approximation
• Mixed Poisson approximation of node depth distributions in random binary search trees
• A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\)
• A Pólya approximation to the Poisson-binomial law

Cited in

(4)

• Mixed Poisson approximation of node depth distributions in random binary search trees
• Approximating functions by their Poisson transform
• The depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace
• On the silhouette of binary search trees

This page was built for publication: A hooray for Poisson approximation

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