On the number of leaves in a random recursive tree
From MaRDI portal
Publication:890282
Recommendations
Cites work
- scientific article; zbMATH DE number 1981006 (Why is no real title available?)
- scientific article; zbMATH DE number 1409903 (Why is no real title available?)
- Breakage and restoration in recursive trees
- Concentration of measures via size-biased couplings
- Cutting down recursive trees
- Distribution of nodes of a tree by degree
- Fundamentals of Stein's method
- Hopf-algebraic structure of families of trees
- Multivariate normal approximations by Stein's method and size bias couplings
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
Cited in
(8)- Detection of common subtrees with identical label distribution
- Isomorphic unordered labeled trees up to substitution ciphering
- On leaf related statistics in recursive tree models
- Quantification and statistical analysis of topological features of recursive trees
- Sharp large deviations and concentration inequalities for the number of descents in a random permutation
- scientific article; zbMATH DE number 1552326 (Why is no real title available?)
- Total Path Length for Random Recursive Trees
- On the size of paged recursive trees
This page was built for publication: On the number of leaves in a random recursive tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890282)