https://doi.org/10.1140/epjb/e2004-00112-3
Optimization of robustness of complex networks
1
Center for Polymer Studies and Dept. of Physics, Boston University, Boston, MA 02215, USA
2
Department of Electrical Engineering, Kochi National College of Technology Monobe-Otsu 200-1, Nankoku, Kochi, 783-8508, Japan
3
Minerva Center and Department of Physics, Bar Ilan University
Ramat Gan 52900, Israel
Corresponding author: a gerryp@bu.edu
Received:
9
December
2003
Revised:
20
January
2004
Published online:
14
May
2004
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,
k1 (close to the average number of links per node), and one node is
of very large degree, , where N is the number of
nodes in the network.
PACS: 89.20.Hh – World Wide Web, Internet / 02.50.Cw – Probability theory / 64.60.Ak – Renormalization-group, fractal, and percolation studies of phase transitions
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004