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
相关论文
共 50 条
  • [1] Network Robustness Analysis Based on Maximum Flow
    Cai, Meng
    Liu, Jiaqi
    Cui, Ying
    Frontiers in Physics, 2021, 9
  • [2] The computation of maximum flow in network analysis based on quotient space theory
    Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University, Hefei
    230039, China
    不详
    230039, China
    Jisuanji Xuebao, 8 (1705-1712):
  • [3] An Algorithm for Maximum Flow Analysis in Traffic Network Based on Fuzzy Matrix
    Zhao, Feng
    Gu, Yundong
    COMMUNICATIONS AND INFORMATION PROCESSING, PT 2, 2012, 289 : 368 - +
  • [4] An Improved Algorithm of Network Maximum Flow Based on Network Flow Matrix
    Wang, ZhenChao
    Zhang, LiPing
    Hao, WeiDong
    Advanced Multimedia and Ubiquitous Engineering: Future Information Technology, 2015, 352 : 351 - 356
  • [5] Maximum flow in a network
    Flux maximum dans un reseau
    1600, Publ by Bucharest Polytechnic Institute, Bucharest, Rom (52):
  • [6] ANALYSIS OF PREFLOW PUSH ALGORITHMS FOR MAXIMUM NETWORK FLOW
    CHERIYAN, J
    MAHESHWARI, SN
    SIAM JOURNAL ON COMPUTING, 1989, 18 (06) : 1057 - 1086
  • [7] Analysis of maximum flow in random graphs for network coding
    Wang, HZ
    Fan, PY
    Cao, ZG
    IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings, Vols 1 and 2, 2005, : 1062 - 1065
  • [8] ANALYSIS OF PREFLOW PUSH ALGORITHMS FOR MAXIMUM NETWORK FLOW
    CHERIYAN, J
    MAHESHWARI, SN
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 338 : 30 - 48
  • [9] A new network structure entropy based on maximum flow
    Cai Meng
    Du Hai-Feng
    Feldman, Marcus W.
    ACTA PHYSICA SINICA, 2014, 63 (06)
  • [10] Measuring Network Robustness by Average Network Flow
    Si, Weisheng
    Mburano, Balume
    Zheng, Wei Xing
    Qiu, Tie
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (03): : 1697 - 1712