...
首页> 外文期刊>PHYSICAL REVIEW E >Robustness of network of networks under targeted attack
【24h】

Robustness of network of networks under targeted attack

机译:网络针对性攻击的鲁棒性

获取原文
获取原文并翻译 | 示例

摘要

The robustness of a network of networks (NON) under random attack has been studied recently [Gao et al.,nPhys. Rev. Lett. 107, 195701 (2011)]. Understanding how robust a NON is to targeted attacks is a major challengenwhen designing resilient infrastructures. We address here the question how the robustness of a NON is affectednby targeted attack on high- or low-degree nodes. We introduce a targeted attack probability function that isndependent upon node degree and study the robustness of two types of NON under targeted attack: (i) a tree of nnfully interdependent Erd˝os-R´enyi or scale-free networks and (ii) a starlike network of n partially interdependentnErd˝os-R´enyi networks. For any tree of n fully interdependent Erd˝os-R´enyi networks and scale-free networksnunder targeted attack, we find that the network becomes significantly more vulnerable when nodes of higherndegree have higher probability to fail. When the probability that a node will fail is proportional to its degree,nfor a NON composed of Erd˝os-R´enyi networks we find analytical solutions for the mutual giant component P∞nas a function of p, where 1 − p is the initial fraction of failed nodes in each network. We also find analyticalnsolutions for the critical fraction pc, which causes the fragmentation of the n interdependent networks, and for thenminimum average degree ¯kmin below which the NON will collapse even if only a single node fails. For a starlikenNON of n partially interdependent Erd˝os-R´enyi networks under targeted attack, we find the critical couplingnstrength qc for different n. When q > qc , the attacked system undergoes an abrupt first order type transition.nWhen q u0002 qc, the system displays a smooth second order percolation transition.We also evaluate how the centralnnetwork becomes more vulnerable as the number of networks with the same coupling strength q increases. Thenlimit of q = 0 represents no dependency, and the results are consistent with the classical percolation theory of ansingle network under targeted attack.
机译:最近已经研究了网络网络(NON)在随机攻击下的鲁棒性[Gao et al。,nPhys。牧师107,195701(2011)]。在设计弹性基础架构时,了解NON对目标攻击的鲁棒性是一个重大挑战。我们在这里解决以下问题:对高或低度节点的定向攻击如何影响NON的鲁棒性。我们介绍了一种不依赖于节点程度的有针对性的攻击概率函数,并研究了两种类型的NON在有针对性的攻击下的鲁棒性:(i)一棵相互依存的Erd˝os-R'enyi或无标度网络的树,以及(ii) n个部分相互依存的nErd˝os-R´enyi网络的星形网络。对于n个完全相互依赖的Erd˝os-R'enyi网络和无标度网络的任何一棵树,在有针对性的攻击下,我们发现,当n度较高的节点发生故障的可能性较高时,网络变得更加脆弱。当节点失效的概率与其度成正比时,对于由Erd˝os-R'enyi网络组成的NON,我们找到了p的互巨分量P∞nas的解析解,其中1 − p是每个网络中故障节点的初始分数。我们还找到了临界分数pc的解析解,这导致n个相互依存的网络碎片化,然后对于最小平均度kmin,即使只有一个节点发生故障,NON也会崩溃。对于在目标攻击下n个部分相互依赖的Erd˝os-R´enyi网络的starlikenNON,我们发现了不同n的临界耦合强度qc。当q> qc时,被攻击系统会经历突然的一阶类型跃迁。n当q u0002 qc时,系统会显示平滑的二阶渗流跃迁。我们还评估了随着耦合强度相同的网络数量,中心网络如何变得更加脆弱q增加。则q = 0的极限表示没有依赖性,其结果与针对目标攻击的单个网络的经典渗流理论相一致。

著录项

  • 来源
    《PHYSICAL REVIEW E》 |2013年第5期|1-11|共11页
  • 作者单位

    Nonlinear Scientific Research Center Faculty of Science Jiangsu University Zhenjiang 212013 ChinaCenter for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USA;

    Center for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USADepartment of Automation Shanghai Jiao Tong University Shanghai 200240 China;

    Nonlinear Scientific Research Center Faculty of Science Jiangsu University Zhenjiang 212013 ChinaCenter for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USACollege of Mathematics Science Chongqing Normal University Chongqing 401331 China;

    Nonlinear Scientific Research Center Faculty of Science Jiangsu University Zhenjiang 212013 China;

    Center for Polymer Studies and Department of Physics Boston University Boston Massachusetts 02215 USA;

    Department of Physics Bar-Ilan University 52900 Ramat-Gan Israel;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号