title: Optimization of robustness and connectivity in complex networks.
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 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.
authors.affiliation: New England Complex Systems Institute, Cambridge, Massachusetts 02138, USA.
authors.forename: Benjamin
authors.initials: B
authors.lastname: Shargel
authors.forename: Hiroki
authors.initials: H
authors.lastname: Sayama
authors.forename: Irving R
authors.initials: IR
authors.lastname: Epstein
authors.forename: Yaneer
authors.initials: Y
authors.lastname: Bar-Yam
mesh_terms: D008954:Models, Biological; D008962:Models, Theoretical; D012944:Social Support