期刊文献+

基于网络模体特征攻击的网络抗毁性研究 被引量:4

Network Destruction Resistance Based on Network Motif Feature
下载PDF
导出
摘要 真实网络如生物神经网络、食物链网络中含有模体结构。但对于这种含有模体特征的网络,并没有一种针对性的攻击策略与之对应,在此基础上提出了模体度代数算法和一种模体攻击失效方式,设计了不同于传统攻击的模体攻击策略。对已检验出的具有明显模体特征的2个仿真网络,5个不同规模的实证网络利用该策略进行模体攻击,并与传统的点攻击方式进行对比研究。仿真结果表明:含有模体特征的网络在模体攻击下的抗毁性明显低于传统的点攻击策略,且在模体特征较明显的网络中模体攻击策略对网络的破坏性更加显著。 Real networks such as biological neural networks,food chain networks contain motif structure.But for this kind of network with the motif characters,there is no corresponded attack strategy.In this paper,we propose a motif degree algebraic algorithm and a motif attack failure mode for this kind of network with the characteristics of the motif structure.We design a model attack strategy which is different from the traditional attack.By using this strategy,two simulation networks and five different size real networks with distinct motif characteristics are simulated and compared with the traditional point attack strategy.The simulation results show that the survivability of the network with the motif feature under the motif attack strategy is obviously lower than traditional point attack strategy.And the motif attacking strategy is more significant to the network with obvious motif characteristics.
出处 《复杂系统与复杂性科学》 CSCD 北大核心 2017年第4期43-50,共8页 Complex Systems and Complexity Science
基金 国家自然科学基金(71140015 71372135) 国家自然科学基金青年科学基金(61303028) 中央高校基本科研业务费专项基金(2015-zy-115)
关键词 模体攻击策略 模体 模体度 网络抗毁性 motif attack strategy motif degree of motif network survivability
  • 相关文献

参考文献5

二级参考文献52

  • 1胡健,杨炳儒.基于边聚集系数的社区结构发现算法[J].计算机应用研究,2009,26(3):858-859. 被引量:10
  • 2汪小帆,李翔,陈关荣.复杂网络理论与应用[M].北京:清华大学出版社,2006:25-78.
  • 3Newman M E. The structure and function of complex networks[J]. SIAM Review, 2003, 45(2): 167-256.
  • 4Myers C R. Software systems as complex networks: Structure, function, and evolvability of software collaboration graphs[J]. Physical Review E, 2003, 68(4): 46116.
  • 5De M A, Lai Y C, Motter A E. Signatures of small-world and scale-free properties in large computer programs[J]. Physical Review E, 2003, 68(1): 17102.
  • 6Valverde S, Cancho R F, Sole R V. Scale-free networks from optimal design[J]. Europhysics Letters (EPL), 2002, 60(4): 512-517.
  • 7Hyland W D, Carrington D, Kaplan S. Scale-free nature of java software package, class and method collaboration graphs[R]. MIND Laboratory, University of Maryland College Park, 2006.
  • 8Milo R, Shen-Orr S, Itzkovitz S, et al. Network motifs: Simple building blocks of complex networks[J]. Science, 2002, 298(5594): 824-827.
  • 9Milo R, Itzkovitz S, Kashtan N, et al. Superfamilies of evolved and designed networks[J]. Science, 2004, 303(5663): 1538-1542.
  • 10Kannan R, Tetali P, Vempala S. Simple Markov-chain algorithms for generating bipartite graphs and tournaments[C]. New Orleans, LA, USA: ACM, 1997.

共引文献51

同被引文献36

引证文献4

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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