Limit Theorems for Subtree Size Profiles of Increasing Trees

DOI10.1017/S096354831100071XzbMath1242.05247OpenAlexW2021738579MaRDI QIDQ2888869

Michael Fuchs

Publication date: 4 June 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354831100071x

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (7)

Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ On the distribution of betweenness centrality in random trees ⋮ On the size of paged recursive trees ⋮ Tree evolution processes for bucket increasing trees ⋮ Central Limit Theorems for Additive Tree Parameters with Small Toll Functions ⋮ A central limit theorem for additive functionals of increasing trees ⋮ Distinct fringe subtrees in random trees

Cites Work

• Unnamed Item
• Unnamed Item
• On the richness of the collection of subtrees in random binary search trees
• The expected profile of digital search trees
• Limiting distributions for additive functionals on Catalan trees
• Martingales and profile of binary search trees
• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• On the degree distribution of the nodes in increasing trees
• The profile of binary search trees
• Limit theorems for patterns in phylogenetic trees
• A functional limit theorem for the profile of search trees
• The mean and variance of the numbers of \(r\)-pronged nodes and \(r\)-caterpillars in Yule-generated genealogical trees
• Phase changes in random point quadtrees
• Emergence of Scaling in Random Networks
• Profiles of random trees: Plane-oriented recursive trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
• Profiles of Tries
• On the profile of random trees
• On the Subtree Size Profile of Binary Search trees
• Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
• Level of nodes in increasing trees revisited
• Profiles of random trees: correlation and width of random recursive trees and binary search trees

This page was built for publication: Limit Theorems for Subtree Size Profiles of Increasing Trees