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/MS099111761zbMATH Open1358.60043OpenAlexW2464866006MaRDI QIDQ2964370FDOQ2964370

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

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

zbMATH Keywords

Poisson approximationStein-Chen methodbinary search tree

Mathematics Subject Classification ID

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

Cited In (2)

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

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)