On the number of leaves in a random recursive tree

DOI10.1214/14-BJPS252zbMath1360.05081MaRDI QIDQ890282

Ya Zhe Zhang

Publication date: 10 November 2015

Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bjps/1442513452

zbMATH Keywords

Stein's methodKolmogorov distancerandom permutationnormal approximationconcentration inequalityWasserstein distancerandom recursive treesize-bias method

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (4)

On leaf related statistics in recursive tree models ⋮ Detection of common subtrees with identical label distribution ⋮ Quantification and statistical analysis of topological features of recursive trees ⋮ Isomorphic unordered labeled trees up to substitution ciphering

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• Concentration of measures via size-biased couplings
• Hopf-algebraic structure of families of trees
• Cutting down recursive trees
• 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
• Multivariate normal approximations by Stein's method and size bias couplings

This page was built for publication: On the number of leaves in a random recursive tree