Attack vulnerability of complex networks

Details Attack vulnerability of complex networks Attack vulnerability of complex networks

2002-02-22

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

Phys. Rev. E 65, 056109 (2002).

Physics

Condensed Matter

Disordered Systems and Neural Networks

To appear in Phys. Rev. E

Scientific paper

10.1103/PhysRevE.65.056109

We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and the network performance is quantitatively measured by the average inverse geodesic length and the size of the largest connected subgraph. For each case of attacks on vertices and edges, four different attacking strategies are used: removals by the descending order of the degree and the betweenness centrality, calculated for either the initial network or the current network during the removal procedure. It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed. Furthermore, the correlation between the betweenness centrality and the degree in complex networks is studied.

Affiliated with

Also associated with

No associations

Rating

Attack vulnerability of complex networks 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 Attack vulnerability of complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Attack vulnerability of complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307787