Optimization of Robustness of Complex Networks

Details Optimization of Robustness of Complex Networks Optimization of Robustness of Complex Networks

2004-04-14

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

Physics

Condensed Matter

Other Condensed Matter

Accepted for publication in European Physical Journal B

Scientific paper

10.1140/epjb/e2004-00112-3

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random failure and intentional attack while keeping the cost of the network (which we take to be the average number of links per node) constant. We find optimal parameters for: (i) scale free networks having degree distributions with a single power-law regime, (ii) networks having degree distributions with two power-law regimes, and (iii) networks described by degree distributions containing two peaks. Of these various kinds of distributions we find that the optimal network design is one in which all but one of the nodes have the same degree, $k_1$ (close to the average number of links per node), and one node is of very large degree, $k_2 \sim N^{2/3}$, where $N$ is the number of nodes in the network.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9716