Network Robustness Analysis Based on Maximum Flow

被引:5
作者
Cai, Meng [1 ]
Liu, Jiaqi [1 ]
Cui, Ying [2 ]
机构
[1] Xi An Jiao Tong Univ, Sch Humanities & Social Sci, Xian, Peoples R China
[2] Xidian Univ, Sch Mech Elect Engn, Xian, Peoples R China
来源
FRONTIERS IN PHYSICS | 2021年 / 9卷
基金
中国国家自然科学基金;
关键词
network robustness; maximum flow; connectivity; resilience; critical damage rate; RESILIENCE; INTERNET; ATTACK;
D O I
10.3389/fphy.2021.792410
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Network robustness is the ability of a network to maintain a certain level of structural integrity and its original functions after being attacked, and it is the key to whether the damaged network can continue to operate normally. We define two types of robustness evaluation indicators based on network maximum flow: flow capacity robustness, which assesses the ability of the network to resist attack, and flow recovery robustness, which assesses the ability to rebuild the network after an attack on the network. To verify the effectiveness of the robustness indicators proposed in this study, we simulate four typical networks and analyze their robustness, and the results show that a high-density random network is stronger than a low-density network in terms of connectivity and resilience; the growth rate parameter of scale-free network does not have a significant impact on robustness changes in most cases; the greater the average degree of a regular network, the greater the robustness; the robustness of small-world network increases with the increase in the average degree. In addition, there is a critical damage rate (when the node damage rate is less than this critical value, the damaged nodes and edges can almost be completely recovered) when examining flow recovery robustness, and the critical damage rate is around 20%. Flow capacity robustness and flow recovery robustness enrich the network structure indicator system and more comprehensively describe the structural stability of real networks.
引用
收藏
页数:26
相关论文
共 48 条
  • [1] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [2] [Anonymous], 2013, P C WORKSH NEUR INF
  • [3] Bai Y, 2017, PROGNOST SYST HEALT, P307
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Counterterrorism's New Tool: 'Metanetwork' Analysis
    Bohannon, John
    [J]. SCIENCE, 2009, 325 (5939) : 409 - 411
  • [6] Breakdown of the internet under intentional attack
    Cohen, R
    Erez, K
    ben-Avraham, D
    Havlin, S
    [J]. PHYSICAL REVIEW LETTERS, 2001, 86 (16) : 3682 - 3685
  • [7] Resilience of the Internet to random breakdowns
    Cohen, R
    Erez, K
    ben-Avraham, D
    Havlin, S
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (21) : 4626 - 4628
  • [8] Optimal resilience of modular interacting networks
    Dong, Gaogao
    Wang, Fan
    Shekhtman, Louis M.
    Danziger, Michael M.
    Fan, Jingfang
    Du, Ruijin
    Liu, Jianguo
    Tian, Lixin
    Stanley, H. Eugene
    Havlin, Shlomo
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2021, 118 (22)
  • [9] Robustness on interdependent networks with a multiple-to-multiple dependent relationship
    Dong, Gaogao
    Chen, Yan
    Wang, Fan
    Du, Ruijin
    Tian, Lixin
    Stanley, H. Eugene
    [J]. CHAOS, 2019, 29 (07)
  • [10] k-core organization of complex networks -: art. no. 040601
    Dorogovtsev, SN
    Goltsev, AV
    Mendes, JFF
    [J]. PHYSICAL REVIEW LETTERS, 2006, 96 (04)