A preferential attachment process approaching the Rado graph

DOI10.1017/S0013091519000336zbMath1437.05212arXiv1603.08806MaRDI QIDQ4961139

Richard H. Elwes

Publication date: 22 April 2020

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08806

zbMATH Keywords

Rado graphpreferential attachmentscale-free networkErdős-Rényi graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Infinite graphs (05C63)

Related Items

Preferential attachment processes approaching the Rado multigraph ⋮ Growth of common friends in a preferential attachment model ⋮ On the dense preferential attachment graph models and their graphon induced counterpart

Cites Work

• Unnamed Item
• Unnamed Item
• Random networks with sublinear preferential attachment: degree evolutions
• The diameter of a scale-free random graph
• Random networks with sublinear preferential attachment: the giant component
• The degree sequence of a scale-free random graph process
• Emergence of Scaling in Random Networks
• Preferential attachment processes approaching the Rado multigraph
• Connectivity Transitions in Networks with Super-Linear Preferential Attachment
• Bernard Friedman's Urn
• The random graph