A non-uniform bound on Poisson approximation of the number of subtrees of size k in a random binary search tree T_n

DOI10.17654/MS099111761MaRDI QIDQ2964370zbMATH OpenOpenAlexFDO

Authors Adchara Kumla, Angkana Boonyued

Publication date 24 February 2017

Published in Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/9888.htm

zbMATH Keywords

binary search treePoisson approximationStein-Chen method

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Central limit and other weak theorems (60F05)

Recommendations

• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Poisson approximations for functionals of random trees
• On the subtrees of random binary search trees
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Using Stein's method to show Poisson and normal limit laws for fringe subtrees

Cited in

(3)

• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Poisson approximations for functionals of random trees
• A hooray for Poisson approximation

This page was built for publication: A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\)

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