Cost-effectiveness Analysis of Structural Robustness in Complex Networks

被引:0
作者
Tan, Suo-Yi [1 ]
Deng, Ye [1 ]
Wu, Jun [1 ]
机构
[1] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Hunan, Peoples R China
来源
2019 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS) | 2019年
基金
中国国家自然科学基金;
关键词
CONNECTIVITY; PERCOLATION; INTERNET;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As the robustness of network is mainly determined by the number of redundant paths in the network, many networks perform well in some robustness metrics just because of their large network sizes. It is well-known that edge addition can remarkably enhance the robustness of complex networks. However, more edges lead to more costs. Thus, it is an interesting and significant problem to obtain a cost-efficient network for robustness. In our recent work, the natural connectivity has been proposed as a spectral measure of robustness in complex networks as it has an intuitive physical meaning and a simple mathematical formulation, which has proved reliably in measuring structure robustness. In this paper, we propose to measure the cost-effectiveness ratio of network robustness using the concept of relative natural connectivity, which is defined as the ratio of the natural connectivity of a network to the natural connectivity of the referential Erdos-Renyi random graph with the same network size and edge density. Extensive numerical simulations confirm our method.
引用
收藏
页数:5
相关论文
共 38 条
[1]   Explosive Percolation in Random Networks [J].
Achlioptas, Dimitris ;
D'Souza, Raissa M. ;
Spencer, Joel .
SCIENCE, 2009, 323 (5920) :1453-1555
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[4]  
Aldersonl D L., 2009, OPER RES, P363
[5]   Biological networks: The tinkerer as an engineer [J].
Alon, U .
SCIENCE, 2003, 301 (5641) :1866-1867
[6]  
[Anonymous], 2004, Internet Math, DOI DOI 10.1080/15427951.2004.10129080
[7]   ANALYTICAL APPROACH TO DISCRETE OPTIMIZATION OF QUEUING-NETWORKS [J].
BAUER, G ;
BOLCH, G .
COMPUTER COMMUNICATIONS, 1990, 13 (08) :494-502
[8]   Network robustness and fragility: Percolation on random graphs [J].
Callaway, DS ;
Newman, MEJ ;
Strogatz, SH ;
Watts, DJ .
PHYSICAL REVIEW LETTERS, 2000, 85 (25) :5468-5471
[9]   The average distances in random graphs with given expected degrees [J].
Chung, F ;
Lu, LY .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (25) :15879-15882
[10]  
Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6