arXiv Analytics

Sign in

arXiv:cond-mat/0408680AbstractReferencesReviewsResources

Stability in the evolution of random networks

L. P. Chi, C. B. Yang, X. Cai

Published 2004-08-31, updated 2005-03-08Version 3

With a simple model, we study the evolution of random networks under attack and reconstruction. We introduce a new quality, invulnerability I(s), to describe the stability of the system. We find that the network can evolve to a stationary state. The stationary value I_c has a power-law dependence on the initial average degree <k>, with the slope is about -1.485. In the stationary state, the degree distribution is a normal distribution, rather than a typical Poisson distribution for general random graphs. The clustering coefficient in the stationary state is much larger than that in the initial state. The stability of the network depends only on the initial average degree <k>, which increases rapidly with the decrease of <k>.

Related articles: Most relevant | Search more
arXiv:1403.5884 [cond-mat.dis-nn] (Published 2014-03-24, updated 2014-05-30)
Entropy distribution and condensation in random networks with a given degree distribution
arXiv:cond-mat/0504551 (Published 2005-04-21)
Clique percolation in random networks
arXiv:cond-mat/0001459 (Published 2000-01-31)
Comment to "Emergence of Scaling in Random Networks" (cond-mat/9910332)