...
首页> 外文期刊>Physica, A. Statistical mechanics and its applications >Conditional attack strategy for real-world complex networks
【24h】

Conditional attack strategy for real-world complex networks

机译:现实世界复杂网络的条件攻击策略

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

获取外文期刊封面封底 >>

       

摘要

When attacking a real-world complex network, the removing strategy based on recalculated nodes betweenness centrality (Bet) is usually the best strategy for reducing the size of the largest connected component (LCC). In particular during the early stage of the removing process, the Bet strategy can reduce the size of LCC by a order of magnitude smaller than all other common strategies. However, near the end of this process, it can be less efficient and fail to completely break the network before other strategies. We found that this limit has origin from the nature of the betweenness centrality's definition: when a subgraph is very well connected, the betweenness of their nodes is very small and if it is a complete subgraph (a clique), the betweenness centrality of all nodes is zero. In consequence, when the network becomes fragmented and the largest connected component is (or closed to) a complete graph, the betweenness strategy will almost ignore it and remove nodes elsewhere, thus making the size of the LCC unchanged. Therefore, we propose a modified strategy that remove the highest betweenness node (global) conditioned on whether the node is in the LCC. If it is not, the strategy will seek inside the LCC and remove the one with the highest betweenness (local). We analyzed the efficacy of this strategy for several real-world complex networks and found that it is consistently the most efficient for all networks and for all time during the attacking process. Finally, we analyze the relationship between the relative efficiency of the betweenness centrality with respect to other strategies and the network's clustering structure. We found that real-world complex networks owing to higher clustering are more vulnerable to the Bet attack strategy. We show this relation by comparing different social networks, and then comparing two financial networks (SP500) sampled at different times that present the same number of nodes but different clustering coefficient level. This wo
机译:攻击现实世界复杂网络时,基于重新计算的节点之间的删除策略(BET)通常是降低最大连接组件(LCC)大小的最佳策略。特别是在去除过程的早期阶段,BET策略可以将LCC的尺寸减小到比所有其他常见策略小的数量级。但是,在此过程的结束时,它可能会效率较低,并且无法在其他策略之前完全打破网络。我们发现,这个限制来自于之间的性质中度数的定义:当一个子图连接时,它们的节点之间的度非常小,如果它是完整的子图(一个集团),所有节点的中心中心是零。结果,当网络变得支离破碎和最大连接成分是(或关闭以)一个完整的曲线图中,中介策略将几乎忽略它和其他地方删除节点,从而使LCC的大小不变。因此,我们提出了一种修改的策略,可以在LCC中删除最高的节点(全局)条件。如果不是,则该策略将在LCC内寻求并将其删除在最高(本地)。我们分析了这种策略对几个现实世界复杂网络的功效,发现它对所有网络和攻击过程中的所有时间都是最有效的。最后,我们分析了与其他策略与网络聚类结构之间的相对效率与网络的聚类结构之间的关系。我们发现,由于较高的聚类,现实世界的复杂网络更容易受到BET攻击战略的影响。通过比较不同的社交网络,然后比较在呈现相同数量的节点但群集系数级别的不同时间进行采样的两个金融网络(SP500)来展示这一关系。这个wo.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号