arXiv Analytics

Sign in

arXiv:cond-mat/0512485AbstractReferencesReviewsResources

Scale-free networks without growth

Yan-Bo Xie, Tao Zhou, Bing-Hong Wang

Published 2005-12-20Version 1

In this letter, we proposed an ungrowing scale-free network model, wherein the total number of nodes is fixed and the evolution of network structure is driven by a rewiring process only. In spite of the idiographic form of $G$, by using a two-order master equation, we obtain the analytic solution of degree distribution in stable state of the network evolution under the condition that the selection probability $G$ in rewiring process only depends on nodes' degrees. A particular kind of the present networks with $G$ linearly correlated with degree is studied in detail. The analysis and simulations show that the degree distributions of these networks can varying from the Possion form to the power-law form with the decrease of a free parameter $\alpha$, indicating the growth may not be a necessary condition of the self-organizaton of a network in a scale-free structure.

Comments: 4 pages and 3 figures
Journal: Physica A 387, 1683-1688 (2008)
Categories: cond-mat.stat-mech
Related articles: Most relevant | Search more
arXiv:cond-mat/0507345 (Published 2005-07-14)
Sampling properties of random graphs: the degree distribution
arXiv:cond-mat/0605587 (Published 2006-05-24, updated 2008-04-29)
Self-similarity in Fractal and Non-fractal Networks
arXiv:0707.0560 [cond-mat.stat-mech] (Published 2007-07-04, updated 2007-08-14)
Percolation and Loop Statistics in Complex Networks