期刊文献+

复杂网络中节点重要性Damage度量分析 被引量:4

Analysis on Damage Measure of Vertex Importance in Complex Networks
下载PDF
导出
摘要 为从网络健壮性角度研究复杂网络中节点重要性指标Damage问题,理论分析了各类模拟网络包括Barabasi-Albert无标度网络、Erdos-Renyi随机网络以及树形网络上的Damage度量。实证分析了真实网络上Damage指标对于网络功能的影响以及Damage与度的相关性。通过统计分析比较了真实网络在面对Damage攻击及度攻击时的抵御能力。理论与实证分析结果表明:各类复杂网络中存在着数量不可忽视的Damage较大的节点;Damage是一种不可代替的衡量网络节点重要性的指标;Damage较大的节点对于真实网络的功能有重要影响。对于各种不同的网络,对比度攻击和Damage攻击过程,发现存在1个交叉点,在此点之前Damage攻击比度攻击更具破坏性。 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.
出处 《南京理工大学学报》 EI CAS CSCD 北大核心 2012年第6期926-931,共6页 Journal of Nanjing University of Science and Technology
基金 国家自然科学基金(61171132) 教育部人文社科基金(11YJC790295) 江苏省自然科学基金(BK2010280) 上海市自然科学基金(09ZR1413100) 上海市教委科研创新基金(10YS163) 上海市优青基金(sdl09015) 南通市科技计划(BK2011003 BK2012001) 上海市085能源经济服务开放项目
关键词 复杂网络 节点 Damage度量 健壮性 度攻击 complex networks vertices Damage measure robustness degree attacks
  • 相关文献

参考文献7

  • 1Buldyrev S V, Parshani R, Paul G, et al. Catastrophic cascade of failures in interdependent networks [ J ]. Nature, 2010,464 : 1025 - 1028.
  • 2Herrmann 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. 被引量:14
  • 4杨秋英,陈天仑.标度自由网络在随机和蓄意攻击下的自组织临界行为(英文)[J].南开大学学报(自然科学版),2010,43(2):27-33. 被引量:1
  • 5Karrer B, Levina E, Newman M E J. Robustness of community structure in networks [ J ]. Phys Rev E, 2008,77:046119.
  • 6Gross J L, Yellen J. Graph theory and its applications [ M ]. 2nd ed. Boca Raton: Chapman & Hall/CRC Press, 2006.
  • 7Vladimir B, Andrej M. Pajek datasets [ EB/OL ]. http :// vlado. fmf. uni -lj. si/pub/networks/data/, 2006-06 - 12.

二级参考文献21

  • 1张永铮,云晓春,胡铭曾.基于特权提升的多维量化属性弱点分类法的研究[J].通信学报,2004,25(7):107-114. 被引量:35
  • 2孙亮,李东,张涛.网络攻击图的自动生成[J].计算机应用研究,2006,23(3):119-122. 被引量:13
  • 3张涛,胡铭曾,云晓春,李东,孙亮.网络攻击图生成方法研究[J].高技术通讯,2006,16(4):348-352. 被引量:7
  • 4王永杰,鲜明,刘进,王国玉.基于攻击图模型的网络安全评估研究[J].通信学报,2007,28(3):29-34. 被引量:56
  • 5Barabdsi A L, Janssen R. Emergence of scaling in random networks[J]. Science, 1999, 286: 509-512.
  • 6Albert R, Jeong H, Barabdsi A-L. Internet : diameter of the world-wide web[J]. Nature, 1999, 401 : 130- 131.
  • 7Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. ACM SIGCOMM Computer Communication Review, 1999, 29: 251- 262.
  • 8Liljeros F, Edling C R L, Amaral A N, et al. The web of human sexual contacts[J]. Nature, 2001, 411: 907-908.
  • 9Ricard V, Sole Marti Rosas-Casals, Bernat Corominas-Murtra, et al. Robustness of the european power grids under intentional attack[J]. Phys Rev E, 2008, 77:026 102-1-026 107-7.
  • 10Maciej Kurant, Patrick Thiran. Error and attack tolerance of layered complex networks[J]. Phys Rev E, 2007, 76: 026 103-1-026 103-5.

共引文献13

同被引文献35

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部