Quantifying the Robustness of Complex Networks with Heterogeneous Nodes

被引:13
作者
Ratnayake, Prasan [1 ]
Weragoda, Sugandima [1 ]
Wansapura, Janaka [1 ]
Kasthurirathna, Dharshana [2 ]
Piraveenan, Mahendra [3 ]
机构
[1] Univ Colombo, Fac Sci, Dept Phys, Colombo 00700, Sri Lanka
[2] Sri Lanka Inst Informat Technol, Fac Comp, B263, Malabe 10115, Sri Lanka
[3] Univ Sydney, Fac Engn, Complex Syst Res Grp, Camperdown, NSW 2006, Australia
关键词
complex networks; network robustness; network efficiency; node heterogeneity; ATTACK TOLERANCE; SOCIAL NETWORKS; SUPPLY CHAIN; MODELS; RESILIENCE; TRANSPORT; ERROR;
D O I
10.3390/math9212769
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The robustness of a complex network measures its ability to withstand random or targeted attacks. Most network robustness measures operate under the assumption that the nodes in a network are homogeneous and abstract. However, most real-world networks consist of nodes that are heterogeneous in nature. In this work, we propose a robustness measure called fitness-incorporated average network efficiency, that attempts to capture the heterogeneity of nodes using the 'fitness' of nodes in measuring the robustness of a network. Further, we adopt the same measure to compare the robustness of networks with heterogeneous nodes under varying topologies, such as the scale-free topology or the Erdos-Renyi random topology. We apply the proposed robustness measure using a wireless sensor network simulator to show that it can be effectively used to measure the robustness of a network using a topological approach. We also apply the proposed robustness measure to two real-world networks; namely the CO2 exchange network and an air traffic network. We conclude that with the proposed measure, not only the topological structure, but also the fitness function and the fitness distribution among nodes, should be considered in evaluating the robustness of a complex network.
引用
收藏
页数:20
相关论文
共 43 条
  • [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] Models for network evolution
    Banks, DL
    Carley, KM
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 1996, 21 (1-2) : 173 - 196
  • [4] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [5] Network growth models: A behavioural basis for attachment proportional to fitness
    Bell, Michael
    Perera, Supun
    Piraveenan, Mahendrarajah
    Bliemer, Michiel
    Latty, Tanya
    Reid, Chris
    [J]. SCIENTIFIC REPORTS, 2017, 7
  • [6] Competition and multiscaling in evolving networks
    Bianconi, G
    Barabási, AL
    [J]. EUROPHYSICS LETTERS, 2001, 54 (04): : 436 - 442
  • [7] Genetic algorithms in bus network optimization
    Bielli, M
    Caramia, M
    Carotenuto, P
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2002, 10 (01) : 19 - 34
  • [8] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471
  • [9] Carneiro G., 2010, UTM LAB M APRIL, V20, P4
  • [10] Resilience and Vulnerability of Spatial Economic Networks
    Caschili, Simone
    Reggiani, Aura
    Medda, Francesca
    [J]. NETWORKS & SPATIAL ECONOMICS, 2015, 15 (02) : 205 - 210