Optimization of Network Robustness to Random Breakdowns

Details Optimization of Network Robustness to Random Breakdowns Optimization of Network Robustness to Random Breakdowns

2005-07-11

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

Physics

Condensed Matter

Statistical Mechanics

Scientific paper

10.1016/j.physa.2006.02.044

We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes $N$ and a given cost--which we take as the average number of connections per node $\kav$. We find that the network design that maximizes $f_c$, the fraction of nodes that are randomly removed before global connectivity is lost, consists of $q=[(\kav-1)/\sqrt\kav]\sqrt N$ high degree nodes (``hubs'') of degree $\sqrt{\kav N}$ and $N-q$ nodes of degree 1. Also, we show that $1-f_c$ approaches 0 as $1/\sqrt N$--faster than any other network configuration including scale-free networks. We offer a simple heuristic argument to explain our results.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-404408