On the number of leaves in a random recursive tree (Q890282)
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: On the number of leaves in a random recursive tree |
scientific article; zbMATH DE number 6506582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of leaves in a random recursive tree |
scientific article; zbMATH DE number 6506582 |
Statements
On the number of leaves in a random recursive tree (English)
0 references
10 November 2015
0 references
random recursive tree
0 references
normal approximation
0 references
Stein's method
0 references
size-bias method
0 references
Wasserstein distance
0 references
Kolmogorov distance
0 references
random permutation
0 references
concentration inequality
0 references
0 references
0 references
0.8169432282447815
0 references
0.8042410016059875
0 references
0.8023035526275635
0 references
0.7927868366241455
0 references
0.7915947437286377
0 references
