Robustness of network of networks under targeted attack

被引:176
作者
Dong, Gaogao [1 ,2 ,3 ]
Gao, Jianxi [2 ,3 ,4 ]
Du, Ruijin [1 ,2 ,3 ,5 ]
Tian, Lixin [1 ]
Stanley, H. Eugene [2 ,3 ]
Havlin, Shlomo [6 ]
机构
[1] Jiangsu Univ, Nonlinear Sci Res Ctr, Fac Sci, Zhenjiang 212013, Peoples R China
[2] Boston Univ, Ctr Polymer Studies, Boston, MA 02215 USA
[3] Boston Univ, Dept Phys, Boston, MA 02215 USA
[4] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[5] Chongqing Normal Univ, Coll Math Sci, Chongqing 401331, Peoples R China
[6] Bar Ilan Univ, Dept Phys, IL-52900 Ramat Gan, Israel
基金
美国国家科学基金会; 以色列科学基金会; 中国国家自然科学基金;
关键词
INTERNET;
D O I
10.1103/PhysRevE.87.052804
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
The robustness of a network of networks (NON) under random attack has been studied recently [Gao et al., Phys. Rev. Lett. 107, 195701 (2011)]. Understanding how robust a NON is to targeted attacks is a major challenge when designing resilient infrastructures. We address here the question how the robustness of a NON is affected by targeted attack on high-or low-degree nodes. We introduce a targeted attack probability function that is dependent upon node degree and study the robustness of two types of NON under targeted attack: (i) a tree of n fully interdependent Erdos-Renyi or scale-free networks and (ii) a starlike network of n partially interdependent Erdos-Renyi networks. For any tree of n fully interdependent Erdos-Renyi networks and scale-free networks under targeted attack, we find that the network becomes significantly more vulnerable when nodes of higher degree have higher probability to fail. When the probability that a node will fail is proportional to its degree, for a NON composed of Erdos-Renyi networks we find analytical solutions for the mutual giant component P-infinity as a function of p, where 1 - p is the initial fraction of failed nodes in each network. We also find analytical solutions for the critical fraction p(c), which causes the fragmentation of the n interdependent networks, and for the minimum average degree (k) over bar (min) below which the NON will collapse even if only a single node fails. For a starlike NON of n partially interdependent Erdos-Renyi networks under targeted attack, we find the critical coupling strength q(c) for different n. When q > q(c), the attacked system undergoes an abrupt first order type transition. When q <= q(c) , the system displays a smooth second order percolation transition. We also evaluate how the central network becomes more vulnerable as the number of networks with the same coupling strength q increases. The limit of q = 0 represents no dependency, and the results are consistent with the classical percolation theory of a single network under targeted attack. DOI: 10.1103/PhysRevE.87.052804
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] Amina S., 2013, AUTOMATICA, V49, P1
  • [3] [Anonymous], ARXIV10120206V1
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Network physiology reveals relations between network topology and physiological function
    Bashan, Amir
    Bartsch, Ronny P.
    Kantelhardt, Jan. W.
    Havlin, Shlomo
    Ivanov, Plamen Ch
    [J]. NATURE COMMUNICATIONS, 2012, 3
  • [6] Avalanche Collapse of Interdependent Networks
    Baxter, G. J.
    Dorogovtsev, S. N.
    Goltsev, A. V.
    Mendes, J. F. F.
    [J]. PHYSICAL REVIEW LETTERS, 2012, 109 (24)
  • [7] Suppressing cascades of load in interdependent networks
    Brummitt, Charles D.
    D'Souza, Raissa M.
    Leicht, E. A.
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2012, 109 (12) : E680 - E689
  • [8] Catastrophic cascade of failures in interdependent networks
    Buldyrev, Sergey V.
    Parshani, Roni
    Paul, Gerald
    Stanley, H. Eugene
    Havlin, Shlomo
    [J]. NATURE, 2010, 464 (7291) : 1025 - 1028
  • [9] Caldarelli Guido., 2007, Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science, DOI 10.1142/6455
  • [10] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471