Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees

DOI10.1017/jpr.2016.44zbMath1365.05072arXiv1404.2425OpenAlexW2963044105MaRDI QIDQ2836235

Andrea Collevecchio, Abbas Mehrabian, Nicholas C. Wormald

Publication date: 9 December 2016

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

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

zbMATH Keywords

random Apollonian networksrandom \(d\)-ary recursive trees

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (2)

Heavy subtrees of Galton-Watson trees with an application to Apollonian networks ⋮ Long Paths in Random Apollonian Networks

This page was built for publication: Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees