On leaf related statistics in recursive tree models
From MaRDI portal
Publication:2374590
DOI10.1016/j.spl.2016.10.007zbMath1417.05184OpenAlexW2535344081MaRDI QIDQ2374590
Publication date: 15 December 2016
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2016.10.007
Stein's methodcentral limit theoremnumber of leavesuniform recursive treeRiffle-Shuffle distribution
Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- Uniform recursive trees: branching structure and simple random downward walk
- On the number of leaves in a random recursive tree
- Trailing the dovetail shuffle to its lair
- The combinatorics of biased riffle shuffles
- Distribution of nodes of a tree by degree
- Breakage and restoration in recursive trees
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- Note on the heights of random recursive trees and random m‐ary search trees
- Asymptotic degree distribution in random recursive trees
- Total Path Length for Random Recursive Trees
This page was built for publication: On leaf related statistics in recursive tree models