Optimization of Robustness and Connectivity in Complex Networks

  • Shargel B
  • Sayama H
  • Epstein I
 et al. 
  • 108


    Mendeley users who have this article in their library.
  • 82


    Citations of this article.


Scale-free networks rely on a relatively small number of highly connected nodes to achieve a high degree of interconnectivity and robustness to random failure, but suffer from a high sensitivity to directed attack. In this paper we describe a parameterized family of networks and analyze their connectivity and sensitivity, identifying a network that has an interconnectedness closer to that of a scale-free network, a robustness to attack closer to that of an exponential network, and a resistance to failure better than that of either of those networks.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Benjamin Shargel

  • Hiroki Sayama

  • Irving R. Epstein

  • Yaneer Bar-Yam

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free