Optimization of Robustness and Connectivity in Complex Networks

Benjamin Shargel, Hiroki Sayama, Irving R. Epstein, and Yaneer Bar-Yam
Phys. Rev. Lett. 90, 068701 – Published 13 February 2003

Abstract

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 parametrized 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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 22 April 2002

DOI:https://doi.org/10.1103/PhysRevLett.90.068701

©2003 American Physical Society

Authors & Affiliations

Benjamin Shargel1, Hiroki Sayama1,2, Irving R. Epstein1,3, and Yaneer Bar-Yam1

  • 1New England Complex Systems Institute, Cambridge, Massachusetts 02138
  • 2Department of Human Communication, University of Electro-Communications, Chofu, Tokyo 182-8585, Japan
  • 3Department of Chemistry and Volen Center for Complex Systems, Brandeis University, Waltham, Massachusetts 02454

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 90, Iss. 6 — 14 February 2003

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×