|Table of Contents|

Analysis on Damage Measure of Vertex Importance in Complex Networks

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2012年06期
Page:
0-
Research Field:
Publishing date:

Info

Title:
Analysis on Damage Measure of Vertex Importance in Complex Networks
Author(s):
WANG Hui1ZHAO Wenhui1SHI Quan2
1.School of Economics and Management,Shanghai University of Electric Power,Shanghai 200090,China; 2.School of Computer Science and Technology,Nantong University,Nantong 226019,China
Keywords:
complex networksverticesDamage measurerobustnessdegree attacks
PACS:
TP311
DOI:
-
Abstract:
To research the vertex importance index—Damage in complex networks from the perspective of robustness of complex networks,the Damage measures of vertices in synthetic networks including BarabasiAlbert,ErdosRenyi,treelike networks and real complex networks are theoretically analyzed.The influences of Damage on network functions and the correlations between Damage and degrees are empirically analyzed.The resisting abilities of real networks against Damage attacks and degree attacks are compared by statistical analyses.The theoretical and empirical analyses show that:there exist many nonignorable vertices with large Damage in complex networks;Damage is one of the nonreplaceable indexes measuring the importance of vertices;vertices with large Damage value are important for maintaining the functionality of networks.For a variety of networks,the results from comparison of the degree attack with the Damage attack processes show the Damage attack before a crossover point is more destructive than the degree attack.

References:

[1]Buldyrev S V,Parshani R,Paul G,et al.Catastrophic cascade of failures in interdependent networks[J].Nature,2010,464:1025-1028.
[2]Herrmann H J,Schneider C M,Moreira A A,et al.Onionlike network topology enhances robustness against malicious attacks[J].Journal of Statistical Mechanics:Theory and Experiment,2011(1):P01027.
[3]苘大鹏,杨武,杨永田.基于攻击图的网络脆弱性分析方法[J].南京理工大学学报,2008,32(4):416-419. Man Dapeng,Yang Wu,Yang Yongtian.Method based on attack graph for network vulnerability analysis[J].Journal of Nanjing University of Science and Technology,2008,32(4):416-419.
[4]杨秋英,陈天仑.标度自由网络在随机和蓄意攻击下的自组织临界行为[J].南开大学学报(自然科学版),2010,43(2):27-33. Yang Qiuying,Chen Tianlun.Selforganized criticality in a scalefree network with random and intentional attack[J].Acta Scientiarum Naturallum Universitatis Nakaiensis,2010,43(2):27-33.
[5]Karrer B,Levina E,Newman M E J.Robustness of community structure in networks[J].Phys Rev E,2008,77:046119.
[6]Gross J L,Yellen J.Graph theory and its applications[M].2nd ed.Boca Raton:Chapman & Hall/CRC Press,2006.
[7]Vladimir B,Andrej M.Pajek datasets[EB/OL].http://vlado.fmf.uni-lj.si/pub/networks/data/,2006-06-12.

Memo

Memo:
-
Last Update: 2012-12-29