A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\) (Q2964370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A non-uniform bound on Poisson approximation of the number of subtrees of size k in a random binary search tree T_n |
scientific article; zbMATH DE number 6688516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A non-uniform bound on Poisson approximation of the number of subtrees of size \(k\) in a random binary search tree \(T_n\) |
scientific article; zbMATH DE number 6688516 |
Statements
A NON-UNIFORM BOUND ON POISSON APPROXIMATION OF THE NUMBER OF SUBTREES OF SIZE k IN A RANDOM BINARY SEARCH TREE T_n (English)
0 references
24 February 2017
0 references
binary search tree
0 references
Poisson approximation
0 references
Stein-Chen method
0 references
0.8582228422164917
0 references
0.8250102996826172
0 references
0.8235844373703003
0 references
0.8084180951118469
0 references
0.8023707270622253
0 references
