Asymptotic diameter of preferential attachment model

DOI10.1214/26-ECP763MaRDI QIDQ7228975zbMATH OpenFDO

Authors Hang Du, Shuyang Gong, Zhangsong Li, Haodong Zhu

Publication date 14 April 2026

Published in Electronic Communications in Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://projecteuclid.org/journals/electronic-communications-in-probability/volume-31/issue-none/Asymptotic-diameter-of-preferential-attachment-model/10.1214/26-ECP763.full

zbMATH Keywords

diameterpreferential attachment modelrandom graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites work

• Diameter in ultra-small scale-free random graphs
• Diameters in preferential attachment models
• Emergence of Scaling in Random Networks
• Note on the heights of random recursive trees and random m‐ary search trees
• Random Graphs and Complex Networks
• The diameter of a scale-free random graph
• The diameter of dense random regular graphs
• The diameter of random regular graphs
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• The phase transition in inhomogeneous random graphs

This page was built for publication: Asymptotic diameter of preferential attachment model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228975)