TY - JOUR
T1 - Optimization of Robustness and Connectivity in Complex Networks
AU - Shargel, Benjamin
AU - Sayama, Hiroki
AU - Epstein, Irving R.
AU - Bar-Yam, Yaneer
N1 - Funding Information:
This work was supported in part by the NSF (Grants No. 0083885 and No. CHE-9988463).
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=18144412571&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=18144412571&partnerID=8YFLogxK
U2 - 10.1103/PhysRevLett.90.068701
DO - 10.1103/PhysRevLett.90.068701
M3 - Article
C2 - 12633338
AN - SCOPUS:18144412571
SN - 0031-9007
VL - 90
SP - 4
JO - Physical Review Letters
JF - Physical Review Letters
IS - 6
ER -