Stability of complex networks under the evolution of attack and repair

Details Stability of complex networks under the evolution of attack and repair Stability of complex networks under the evolution of attack and repair

2005-05-09

arxiv.org/abs/cond-mat/0505197v1

Physics

Condensed Matter

Statistical Mechanics

5 pages, 5 figures

Scientific paper

10.1088/0256-307X/23/1/076

With a simple attack and repair evolution model, we investigate and compare the stability of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to describe the stability of the system. We find that both RG and SF networks can evolve to a stationary state. The stationary value Ic has a power-law dependence on the average degree _rg for RG networks; and an exponential relationship with the repair probability p_sf for SF networks. We also discuss the topological changes of RG and SF networks between the initial and stationary states. We observe that the networks in the stationary state have smaller average degree but larger clustering coefficient C and stronger assortativity r.

Affiliated with

Also associated with

No associations

Rating

Stability of complex networks under the evolution of attack and repair does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stability of complex networks under the evolution of attack and repair, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of complex networks under the evolution of attack and repair will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-3436