Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
From MaRDI portal
Publication:2513659
DOI10.1007/s11009-013-9333-zzbMath1306.05224OpenAlexW2018187068MaRDI QIDQ2513659
Mark Daniel Ward, Hosam M. Mahmoud, Mohan Gopaladesikan
Publication date: 28 January 2015
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-013-9333-z
Analysis of algorithms (68W40) Trees (05C05) Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Recurrences (11B37)
Related Items (4)
Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ On the variety of shapes in digital trees ⋮ On nodes of small degrees and degree profile in preferential dynamic attachment circuits ⋮ On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees
Cites Work
- An ideal metric and the rate of convergence to a self-similar process
- A general limit theorem for recursive algorithms and combinatorial structures
- Distributions of cherries for two models of trees
- The contraction method for recursive algorithms
- Distribution of nodes of a tree by degree
- Phase changes in randomm-ary search trees and generalized quicksort
- On a multivariate contraction method for random recursive structures with applications to Quicksort
- On the Variety of Shapes on the Fringe of a Random Recursive Tree
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- On the covariance of the level sizes in random recursive trees
- Probability metrics and recursive algorithms
- A limit theorem for “quicksort”
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
