期刊文献+

不同信息条件下加权复杂网络抗毁性仿真研究 被引量:17

Invulnerability simulation of weighted complex networks with different information
下载PDF
导出
摘要 针对加权复杂网络的抗毁性分析问题,选取网络效率和网络鲁棒性作为抗毁性的度量指标,对加权网络在不同信息条件下抗毁性的变化进行数值仿真模拟。最后,对成本和性能约束下加权网络的抗毁性进行定量分析,给出不同信息条件下加权网络抗毁性的优化策略。结果表明:在基于局部拓扑信息的攻击策略下,权重系数越大,网络的抗毁性越强;在基于全局拓扑信息的攻击策略下,网络的抗毁性要优于基于局部信息的攻击策略,且权重系数为0.5的网络在攻击初始阶段抗毁性最强;另外,若能在攻击早期加大对节点的防护力度,则会大大降低对网络性能的影响。 To solve the problems of invulnerability analysis of weighted complex networks, network efficiency and robustness were adopted as the measurements of invulnerability. Based on that, invulnerability of weighted networks with different information was investigated by the numerical simulation. Finally, the quantitative analysis of invulnerability of weighted networks under the restrictions of cost and performance was presented and optimized strategies of invulnerability with different information were proposed. The results demonstrate that under the strategies with local topology information, the larger the weight coefficient, the better the invulnerability. And under the strategies with the whole topology information, weighted networks perform better than that under the strategies with local topology information. Moreover, the network with weight coefficient of 0.5 performs the best in the initial stage of attack. Besides, the influence on the network performance will be reduced if the defense of the nodes is strengthened at the initial stage of attack in every instance.
出处 《中南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2013年第5期1888-1894,共7页 Journal of Central South University:Science and Technology
基金 国家自然科学基金资助项目(71171198 61100042) 湖北省自然科学基金资助项目(2011CDB052)
关键词 加权复杂网络 抗毁性 网络鲁棒性 网络效率 优化策略 weighted complex networks invulnerability network robustness network efficiency optimization strategies
  • 相关文献

参考文献18

  • 1陈关荣,陈增强,吕金虎.复杂网络科学与工程的研究进展(专辑序言)[J].系统工程学报,2010,25(6):723-724. 被引量:11
  • 2谭跃进 吕欣 吴俊 等.复杂网络抗毁性研究若干问题的思考.系统工程理论与实践,2008,(0):116-120. 被引量:20
  • 3Albert R, Jeong H, Barabasi A L. Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382. 被引量:1
  • 4Holme P, Kim B J, Yoon C N, et al. Attack vulnerability of complex networks[J]. Phys Rev E, 2002, 65(5): 056109. 被引量:1
  • 5Paul G, Sreenivasan S, Stanley H E. Resilience of complex networks to random breakdown[J]. Phys Rev E, 2005, 72(5): 056130. 被引量:1
  • 6邓宏钟,吴俊,李勇,吕欣,谭跃进.复杂网络拓扑结构对系统抗毁性影响研究[J].系统工程与电子技术,2008,30(12):2425-2428. 被引量:37
  • 7WU Jun, DENG Hongzhong, TAN Yuejin, et al. Vulnerability of complex networks under intentional attack with imcomplete information[J]. J Phys A, 2007, 40(11): 2665-2671. 被引量:1
  • 8田柳,狄增如,姚虹.权重分布对加权网络效率的影响[J].物理学报,2011,60(2):797-802. 被引量:44
  • 9Ban-at A, Barthelemy M, Pastor-Satorras R, et al. The architecture of complex networks[J]. Proc Natl Acad Sci USA, 2004, 101(11): 3747-3752. 被引量:1
  • 10Dall' Asta L, Bah'at A, Barthelemy M, et al. Vulnerability of weighted networks[J]. Journal of Statistical Mechanics: Theory and Experiment, 2006, P04006. 被引量:1

二级参考文献18

  • 1张冬艳,胡铭曾,张宏莉.基于测量的网络性能评价方法研究[J].通信学报,2006,27(10):74-79. 被引量:53
  • 2Cohen R, Erez K, Ben-Avraham D, et al. Resilience of the Internet to random breakdowns[J]. Phys. Rev. Lett. , 2000, 85 (21): 4626-4628. 被引量:1
  • 3Newman M E J, Strogatz S H, Watts D J. Random graphs with arbitrary degree distributions and their applications[J]. Phys. Rev. E, 2001, 64 (2): 26118. 被引量:1
  • 4Broadbent S R, Hammersley J M. Percolation processes: Ⅰ. Crystals and mazes[J]. Proc. Cambridge Philos Soc. , 1957, 53: 629-641. 被引量:1
  • 5Hammersley J M. Percolation processes: Ⅱ. The connective constant[J]. Proc. Cambridge Philos. Soc., 1957, 53: 642 - 645. 被引量:1
  • 6BEYGELZIMER A,GRINSTEIN G,LINSKER R,et al.Improving network robustness by edge modification[J].Physica:A,2005(357):593-612. 被引量:1
  • 7新华社.国家中长期科学和技术发展规划纲要.(2006-2020年)[EB/OL].(2006-02-09)[2010-03-10].http://www.gov.cn/jrzg/2006-02/09/content_183787.htm. 被引量:1
  • 8BRODY K B.ENG/EFRI FY07 awards announcement[EB/OL].(2007-08-28)[2010-03-10].http://www.nsf.gov/eng/efri/fy07awards,jsp. 被引量:1
  • 9ALBERT R,JEONG H,BARABASI A L.Error and attack tolerance of complex networks[J].Nature,2000,406(7):378-382. 被引量:1
  • 10VENKATASUBRAMANIAN V,KATARE S,PATKAR P R et al.Spontaneous emergence of complex optimal networks through evolutionary adaptation[J].Computers and Chemical Engineering,2004,128(9):1789-1798. 被引量:1

共引文献114

同被引文献197

引证文献17

二级引证文献74

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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