Nonextensive aspects of small-world networks
Abstract
Nonextensive aspects of the degree distribution in Watts-Strogatz (WS) small-world networks, , have been discussed in terms of a generalized Gaussian (referred to as {\it -Gaussian}) which is derived by the three approaches: the maximum-entropy method (MEM), stochastic differential equation (SDE), and hidden-variable distribution (HVD). In MEM, the degree distribution in complex networks has been obtained from -Gaussian by maximizing the nonextensive information entropy with constraints on averages of and in addition to the normalization condition. In SDE, -Gaussian is derived from Langevin equations subject to additive and multiplicative noises. In HVD, -Gaussian is made by a superposition of Gaussians for random networks with fluctuating variances, in analogy to superstatistics. Interestingly, {\it a single} may describe, with an accuracy of , main parts of degree distributions of SW networks, within which about 96-99 percents of all states are included. It has been demonstrated that the overall behavior of including its tails may be well accounted for if the -dependence is incorporated into the entropic index in MEM, which is realized in microscopic Langevin equations with generalized multiplicative noises.
Keywords
Cite
@article{arxiv.cond-mat/0506301,
title = {Nonextensive aspects of small-world networks},
author = {Hideo Hasegawa},
journal= {arXiv preprint arXiv:cond-mat/0506301},
year = {2009}
}
Comments
22 pages, 11 figures, accepted in Physca A with some augmentations