High-dimensional Apollonian networks

DOI10.1088/0305-4470/39/8/003zbMATH Open1086.68017arXivcond-mat/0503316OpenAlexW3105191376WikidataQ57772713 ScholiaQ57772713MaRDI QIDQ3379352FDOQ3379352

Francesc Comellas, Zhongzhi Zhang, Guillaume Fertin, Lili Rong

Publication date: 6 April 2006

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

Abstract: We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension.

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

Recommendations

• Characterizing several properties of high-dimensional random Apollonian networks
• THREE-DIMENSIONAL APOLLONIAN NETWORKS
• Degrees and distances in random and evolving Apollonian networks
• Some properties of random Apollonian networks
• On certain properties of random Apollonian networks

zbMATH Keywords

Apollonian packingdiameter of networksscale-free characterssmall-world characteristics

Mathematics Subject Classification ID

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

Cited In (18)

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

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

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