High Dimensional Apollonian Networks
classification
❄️ cond-mat.other
keywords
networksapolloniandimensionalhighalgorithmanalyticalcharacteristicsclustering
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.