arXiv · cond-mat/0503316
High Dimensional Apollonian Networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Lili Rong. 2005-07-01. High Dimensional Apollonian Networks. https://doi.org/10.1088/0305-4470%2F39%2F8%2F003
Cite the original work for its findings. Save a collection to share your selection of sources.