Preferential attachment growth model and nonextensive statistical mechanics
Abstract
We introduce a two-dimensional growth model where every new site is located, at a distance from the barycenter of the pre-existing graph, according to the probability law , and is attached to (only) one pre-existing site with a probability ; is the number of links of the site of the pre-existing graph, and its distance to the new site). Then we numerically determine that the probability distribution for a site to have links is asymptotically given, for all values of , by , where is the function naturally emerging within nonextensive statistical mechanics. The entropic index is numerically given (at least for not too large) by , and the characteristic number of links by . The particular case belongs to the same universality class to which the Barabasi-Albert model belongs. In addition to this, we have numerically studied the rate at which the average number of links increases with the scaled time ; asymptotically, , the exponent being close to for , and zero otherwise. The present results reinforce the conjecture that the microscopic dynamics of nonextensive systems typically build (for instance, in Gibbs -space for Hamiltonian systems) a scale-free network.
Keywords
Cite
@article{arxiv.cond-mat/0410459,
title = {Preferential attachment growth model and nonextensive statistical mechanics},
author = {Danyel J. B. Soares and Constantino Tsallis and Ananias M. Mariz and Luciano R. da Silva},
journal= {arXiv preprint arXiv:cond-mat/0410459},
year = {2015}
}
Comments
5 pages including 5 figures (the original colored figures 1 and 5a can be asked directly to the authors)