High-dimensional Apollonian networks

DOI10.1088/0305-4470/39/8/003zbMath1086.68017arXivcond-mat/0503316OpenAlexW3105191376WikidataQ57772713 ScholiaQ57772713MaRDI QIDQ3379352

Francesc Comellas, Zhong-Zhi Zhang, Guillaume Fertin, Lili Rong

Publication date: 6 April 2006

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0503316

zbMATH Keywords

Apollonian packingdiameter of networksscale-free characterssmall-world characteristics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication theory (94A05)

Related Items (15)

Enumeration of spanning trees on contact graphs of disk packings ⋮ Two cumulative distributions for scale-freeness of dynamic networks ⋮ Diophantine networks ⋮ SCALE-FREE AND SMALL-WORLD PROPERTIES OF VAF FRACTAL NETWORKS ⋮ Modeling spatial networks by contact graphs of disk packings ⋮ Shape Measures of Random Increasing k-trees ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ The number of spanning trees in Apollonian networks ⋮ Constructions and properties of a class of random scale-free networks ⋮ Incompatibility networks as models of scale-free small-world graphs ⋮ Recursive weighted treelike networks ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Some Properties of Random Apollonian Networks ⋮ The iterated local model for social networks ⋮ On longest paths and diameter in random apollonian networks

This page was built for publication: High-dimensional Apollonian networks