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/MS099111761zbMath1358.60043OpenAlexW2464866006MaRDI QIDQ2964370

Angkana Boonyued, Adchara Kumla

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

Poisson approximationbinary search treeStein-Chen method

Mathematics Subject Classification ID

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

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