中国物理B ›› 2017, Vol. 26 ›› Issue (8): 88901-088901.doi: 10.1088/1674-1056/26/8/088901

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    下一篇

The robustness of sparse network under limited attack capacity

Xiao-Juan Wang(王小娟), Mei Song(宋梅), Lei Jin(金磊), Zhen Wang(王珍)   

  1. 1 Electronic Engineering Institute, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2 Electronic Engineering Institute of PLA, Hefei 230000, China
  • 收稿日期:2017-01-13 修回日期:2017-04-21 出版日期:2017-08-05 发布日期:2017-08-05
  • 通讯作者: Mei Song E-mail:songmbupt@126.com
  • 基金资助:

    Project supported by the National Natural Science Foundation of China (Grant No. 61471055).

The robustness of sparse network under limited attack capacity

Xiao-Juan Wang(王小娟)1, Mei Song(宋梅)1, Lei Jin(金磊)1, Zhen Wang(王珍)2   

  1. 1 Electronic Engineering Institute, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2 Electronic Engineering Institute of PLA, Hefei 230000, China
  • Received:2017-01-13 Revised:2017-04-21 Online:2017-08-05 Published:2017-08-05
  • Contact: Mei Song E-mail:songmbupt@126.com
  • About author:0.1088/1674-1056/26/8/
  • Supported by:

    Project supported by the National Natural Science Foundation of China (Grant No. 61471055).

摘要:

The paper studies the robustness of the network in terms of the network structure. We define a strongly dominated relation between nodes and then we use the relation to merge the network. Based on that, we design a dominated clustering algorithm aiming at finding the critical nodes in the network. Furthermore, this merging process is lossless which means the original structure of the network is kept. In order to realize the visulization of the network, we also apply the lossy consolidation to the network based on detection of the community structures. Simulation results show that compared with six existed centrality algorithms, our algorithm performs better when the attack capacity is limited. The simulations also illustrate our algorithm does better in assortative scale-free networks.

关键词: robustness, dominated relation, merge, lossless

Abstract:

The paper studies the robustness of the network in terms of the network structure. We define a strongly dominated relation between nodes and then we use the relation to merge the network. Based on that, we design a dominated clustering algorithm aiming at finding the critical nodes in the network. Furthermore, this merging process is lossless which means the original structure of the network is kept. In order to realize the visulization of the network, we also apply the lossy consolidation to the network based on detection of the community structures. Simulation results show that compared with six existed centrality algorithms, our algorithm performs better when the attack capacity is limited. The simulations also illustrate our algorithm does better in assortative scale-free networks.

Key words: robustness, dominated relation, merge, lossless

中图分类号: 

  • 89.75.Ck
89.75.Fb (Structures and organization in complex systems)