On the covariance of the level sizes in random recursive trees

DOI10.1002/rsa.10030zbMath1003.60013OpenAlexW2155830639MaRDI QIDQ4543634

Piet Van Mieghem, Remco van der Hofstad, Gerard Hooghiemstra

Publication date: 8 August 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10030

zbMATH Keywords

Stirling numbersmoment generating functionrandom recursive treehopcount problem

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Isolating the most recent entry in a random recursive tree by random cuts ⋮ From trees to graphs: collapsing continuous-time branching processes ⋮ Profile of random exponential recursive trees ⋮ The degree profile of random Pólya trees ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ Random sprouts as internet models, and Pólya processes ⋮ The shape of unlabeled rooted random trees ⋮ Random Networks with Preferential Growth and Vertex Death ⋮ Asymptotic joint normality of counts of uncorrelated motifs in recursive trees ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks

Cites Work

• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• On the Altitude of Nodes in Random Trees
• Poisson approximations for functionals of random trees