Scaling properties of d-dimensional complex networks
Abstract
The area of networks is very interdisciplinary and exhibits many applications in several fields of science. Nevertheless, there are few studies focusing on geographically located -dimensional networks. In this paper, we study scaling properties of a wide class of -dimensional geographically located networks which grow with preferential attachment involving Euclidean distances through . We have numerically analyzed the time evolution of the connectivity of sites, the average shortest path, the degree distribution entropy, and the average clustering coefficient, for , and typical values of . Remarkably enough, virtually all the curves can be made to collapse as functions of the scaled variable . These observations confirm the existence of three regimes. The first one occurs in the interval ; it is non-Boltzmannian with very-long-range interactions in the sense that the degree distribution is a -exponential with constant and above unity. The critical value that emerges in many of these properties is replaced by for the -exponent which characterizes the time evolution of the connectivity of sites. The second regime is still non-Boltzmannian, now with moderately long-range interactions, and reflects in an index monotonically decreasing with increasing from its critical value to a characteristic value . Finally, the third regime is Boltzmannian (with ), and corresponds to short-range interactions.
Cite
@article{arxiv.1810.01686,
title = {Scaling properties of d-dimensional complex networks},
author = {Samuraí Brito and Thiago C. Nunes and Luciano R. da Silva and Constantino Tsallis},
journal= {arXiv preprint arXiv:1810.01686},
year = {2019}
}
Comments
6 pages, 8 figures