Degrees and distances in random and evolving apollonian networks

DOI10.1017/apr.2016.32zbMath1348.05192arXiv1310.3864OpenAlexW3023218291MaRDI QIDQ2830885

No author found.

Publication date: 1 November 2016

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

diameterrandom graphdegree distributionhopcountrandom networktypical distance

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Distance in graphs (05C12) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (6)

SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Heavy subtrees of Galton-Watson trees with an application to Apollonian networks ⋮ Dynamical models for random simplicial complexes ⋮ The height of random k‐trees and related branching processes ⋮ Asymptotic degree distribution in a homogeneous evolving network model

This page was built for publication: Degrees and distances in random and evolving apollonian networks