中国物理B ›› 2021, Vol. 30 ›› Issue (5): 50501-050501.doi: 10.1088/1674-1056/abd468

• • 上一篇    下一篇

Dynamical robustness of networks based on betweenness against multi-node attack

Zi-Wei Yuan(袁紫薇)1,2, Chang-Chun Lv(吕长春)1,2, Shu-Bin Si(司书宾)1,2,†, and Dong-Li Duan(段东立)3   

  1. 1 School of Mechanical Engineering, Northwestern Polytechnical University, Xi'an 710072, China;
    2 Key Laboratory of Industrial Engineering and Intelligent Manufacturing(Ministry of Industry and Information Technology), Xi'an 710072, China;
    3 School of Information and Control Engineering, Xi'an University of Architecture and Technology, Xi'an 710311, China
  • 收稿日期:2020-09-02 修回日期:2020-12-04 接受日期:2020-12-17 出版日期:2021-05-14 发布日期:2021-05-14
  • 通讯作者: Shu-Bin Si E-mail:sisb@nwpu.edu.cn
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 71771186, 71631001, and 72071153) and the Natural Science Foundation of Shaanxi Province, China (Grant Nos. 2020JM-486 and 2020JM-486).

Dynamical robustness of networks based on betweenness against multi-node attack

Zi-Wei Yuan(袁紫薇)1,2, Chang-Chun Lv(吕长春)1,2, Shu-Bin Si(司书宾)1,2,†, and Dong-Li Duan(段东立)3   

  1. 1 School of Mechanical Engineering, Northwestern Polytechnical University, Xi'an 710072, China;
    2 Key Laboratory of Industrial Engineering and Intelligent Manufacturing(Ministry of Industry and Information Technology), Xi'an 710072, China;
    3 School of Information and Control Engineering, Xi'an University of Architecture and Technology, Xi'an 710311, China
  • Received:2020-09-02 Revised:2020-12-04 Accepted:2020-12-17 Online:2021-05-14 Published:2021-05-14
  • Contact: Shu-Bin Si E-mail:sisb@nwpu.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 71771186, 71631001, and 72071153) and the Natural Science Foundation of Shaanxi Province, China (Grant Nos. 2020JM-486 and 2020JM-486).

摘要: We explore the robustness of a network against failures of vertices or edges where a fraction $f$ of vertices is removed and an overload model based on betweenness is constructed. It is assumed that the load and capacity of vertex $i$ are correlated with its betweenness centrality $B_i$ as $B_i^\theta$ and $(1+\alpha) B_i^\theta$ ($\theta$ is the strength parameter, $\alpha$ is the tolerance parameter). We model the cascading failures following a local load preferential sharing rule. It is found that there exists a minimal $\alpha_{\rm c}$ when $\theta$ is between 0 and 1, and its theoretical analysis is given. The minimal $\alpha_{\rm c}$ characterizes the strongest robustness of a network against cascading failures triggered by removing a random fraction $f$ of vertices. It is realized that the minimal $\alpha_{\rm c}$ increases with the increase of the removal fraction $f$ or the decrease of average degree. In addition, we compare the robustness of networks whose overload models are characterized by degree and betweenness, and find that the networks based on betweenness have stronger robustness against the random removal of a fraction $f$ of vertices.

关键词: complex network, robustness, betweenness, critical threshold

Abstract: We explore the robustness of a network against failures of vertices or edges where a fraction $f$ of vertices is removed and an overload model based on betweenness is constructed. It is assumed that the load and capacity of vertex $i$ are correlated with its betweenness centrality $B_i$ as $B_i^\theta$ and $(1+\alpha) B_i^\theta$ ($\theta$ is the strength parameter, $\alpha$ is the tolerance parameter). We model the cascading failures following a local load preferential sharing rule. It is found that there exists a minimal $\alpha_{\rm c}$ when $\theta$ is between 0 and 1, and its theoretical analysis is given. The minimal $\alpha_{\rm c}$ characterizes the strongest robustness of a network against cascading failures triggered by removing a random fraction $f$ of vertices. It is realized that the minimal $\alpha_{\rm c}$ increases with the increase of the removal fraction $f$ or the decrease of average degree. In addition, we compare the robustness of networks whose overload models are characterized by degree and betweenness, and find that the networks based on betweenness have stronger robustness against the random removal of a fraction $f$ of vertices.

Key words: complex network, robustness, betweenness, critical threshold

中图分类号:  (Computational methods in statistical physics and nonlinear dynamics)

  • 05.10.-a
64.60.aq (Networks) 89.75.-k (Complex systems) 89.75.Hc (Networks and genealogical trees)