Optimization of network robustness to random breakdowns

@inproceedings{Paul2006OptimizationON,
  title={Optimization of network robustness to random breakdowns},
  author={Gerald Paul and Sameet Sreenivasan and Shlomo Havlin and Harry Eugene Stanley},
  year={2006}
}
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 〈k〉. We find that the network design that maximizes fc, the fraction of nodes that are randomly removed before global connectivity is lost, consists of q=[(〈k〉-1)/〈k〉]N high degree nodes (“hubs”) of degree 〈k〉N and N-q nodes of degree 1. Also, we show that 1-fc approaches 0 as 1/N—faster than… CONTINUE READING

Figures from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

Network robustness simulator: A case study on epidemic models

  • 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM)
  • 2017
VIEW 5 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED

Design of robust dependent networks against flow-based cascading failures

  • 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

Simulating Social Complexity

  • Understanding Complex Systems
  • 2013

An improved model for cascading failures in complex networks

  • 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems
  • 2012
VIEW 1 EXCERPT
CITES BACKGROUND