Insertion depth in power-weight trees

DOI10.1016/j.ipl.2021.106227zbMath1486.05279OpenAlexW3216955163MaRDI QIDQ2122783

Hosam M. Mahmoud, Merritt Lyon

Publication date: 7 April 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106227

zbMATH Keywords

graph algorithmsrandom treepreferential attachmentChen-Stein methodinsertion depth

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Fundamentals of Stein's method
• Introduction to Random Graphs
• Emergence of Scaling in Random Networks
• Random Trees
• Normal Approximation by Stein’s Method
• On the structure of random plane‐oriented recursive trees and their branches
• Poisson approximations for functionals of random trees
• Trees grown under young-age preferential attachment
• Robust Analysis of Preferential Attachment Models with Fitness
• A Note on the Theory of Moment Generating Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Insertion depth in power-weight trees