首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:On the Influence of Topological Characteristics on Robustness of Complex Networks
  • 本地全文:下载
  • 作者:Dharshana Kasthurirathna ; Mahendra Piraveenan ; Gnanakumar Thedchanamoorthy
  • 期刊名称:Journal of Artificial Intelligence and Soft Computing Research
  • 电子版ISSN:2083-2567
  • 出版年度:2013
  • 卷号:3
  • 期号:2
  • 页码:89-100
  • DOI:10.2478/jaiscr-2014-0007
  • 出版社:Walter de Gruyter GmbH
  • 摘要:In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, small-world and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicable) of a network, and how each of these influence the robustness of a network under targeted attacks. We use an established robustness coefficient to measure topological robustness, and consider sustained targeted attacks by order of node degree. With respect to scale-free networks, we show that assortativity, modularity and average path length have a positive correlation with network robustness, whereas clustering coefficient has a negative correlation. We did not find any correlation between scale-free exponent and robustness, or rich-club profiles and robustness. The robustness of small-world networks on the other hand, show substantial positive correlations with assortativity, modularity, clustering coefficient and average path length. In comparison, the robustness of Erdos-Renyi random networks did not have any significant correlation with any of the network properties considered. A significant observation is that high clustering decreases topological robustness in scale-free networks, yet it increases topological robustness in small-world networks. Our results highlight the importance of topological characteristics in influencing network robustness, and illustrate design strategies network designers can use to increase the robustness of scale-free and small-world networks under sustained targeted attacks.
国家哲学社会科学文献中心版权所有