Improving the robustness of spatial networks by link addition: more and dispersed links perform better

被引:10
作者
Dong, Zhengcheng [1 ]
Tian, Meng [2 ]
Tang, Ruoli [3 ]
Li, Xin [3 ]
Lai, Jingang [4 ]
机构
[1] Wuhan Univ, Sch Elect Engn & Automat, Wuhan, Peoples R China
[2] Wuhan Univ, Elect Informat Sch, Wuhan, Peoples R China
[3] Wuhan Univ Technol, Sch Energy & Power Engn, Wuhan, Peoples R China
[4] Rhein Westfal TH Aachen, EON Energy Res Ctr, Aachen, Germany
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Spatial networks; Robustness; Link addition; Limited addition range; Limited addition length; ADDING CONNECTIVITY; CASCADING FAILURES; VULNERABILITY;
D O I
10.1007/s11071-020-05607-5
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
It is an effective way to improve network robustness by adding connectivity links. Although some addition strategies have been proposed, the addition cost in spatial networks is still missing. This paper adopts a geographical network model to investigate two different constraint scenarios, revealing better addition mechanisms, i.e., limited addition range (LAR) and limited addition length (LAL). In LAR scenario, f additional connections are added within a certain radius r, while only the total length delta of added links is noticed in LAL scenario. With numerical analysis, some ordinary results are first obtained that the robustness of spatial networks improves as f or delta increases, indicating that more links produce better effects. In LAR, adding long links also works effectively. Besides, a special case of LAR is proposed that adding links intensively for a few nodes, and results show that dispersed addition performs better. In LAL, for each delta, feasible solutions are categorized by different numbers of links n delta, and it is found that large n delta has a significant impact on robustness even though delta gets longer. Although adding either more or long links can improve the robustness of spatial networks, it can be concluded that adding more and short links dispersedly outperforms fewer and long ones intensively.
引用
收藏
页码:2287 / 2298
页数:12
相关论文
共 55 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [3] Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks
    Bai, Yiguang
    Liu, Sanyang
    Zhang, Zhaohui
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2017, 28 (08):
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Spatially embedded random networks
    Barnett, L.
    Di Paolo, E.
    Bullock, S.
    [J]. PHYSICAL REVIEW E, 2007, 76 (05)
  • [6] Crossover from scale-free to spatial networks
    Barthélemy, M
    [J]. EUROPHYSICS LETTERS, 2003, 63 (06): : 915 - 921
  • [7] The extreme vulnerability of interdependent spatially embedded networks
    Bashan, Amir
    Berezin, Yehiel
    Buldyrev, Sergey V.
    Havlin, Shlomo
    [J]. NATURE PHYSICS, 2013, 9 (10) : 667 - 672
  • [8] Improving network robustness by edge modification
    Beygelzimer, A
    Grinstein, GE
    Linsker, R
    Rish, I
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 357 (3-4) : 593 - 612
  • [9] Catastrophic cascade of failures in interdependent networks
    Buldyrev, Sergey V.
    Parshani, Roni
    Paul, Gerald
    Stanley, H. Eugene
    Havlin, Shlomo
    [J]. NATURE, 2010, 464 (7291) : 1025 - 1028
  • [10] Improving the network robustness against cascading failures by adding links
    Cao, Xian-Bin
    Hong, Chen
    Du, Wen-Bo
    Zhang, Jun
    [J]. CHAOS SOLITONS & FRACTALS, 2013, 57 : 35 - 40