Trees grown under young-age preferential attachment

DOI10.1017/jpr.2020.49zbMath1453.05022OpenAlexW3083133409MaRDI QIDQ5139910

Merritt Lyon, Hosam M. Mahmoud

Publication date: 11 December 2020

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionStirling numbersPoisson approximationrandom treepreferential attachmentsmall worldChen-Stein methodoutdegreerecursive treeinsertion depthtree leaves

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Bell and Stirling numbers (11B73) Stochastic network models in operations research (90B15) Combinatorial probability (60C05) (L^p)-limit theorems (60F25)

Related Items (3)

Insertion depth in power-weight trees ⋮ The containment profile of hyper-recursive trees ⋮ Profile of random exponential recursive trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• The degree sequence of a scale-free random graph process
• Introduction to Random Graphs
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
• Random Trees
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• On the structure of random plane‐oriented recursive trees and their branches
• A Note on the Theory of Moment Generating Functions
• Probability: A Graduate Course

This page was built for publication: Trees grown under young-age preferential attachment