Author:
Carchiolo Vincenza,Grassia Marco,Longheu Alessandro,Malgeri Michele,Mangioni Giuseppe
Abstract
AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Human-Computer Interaction,Modeling and Simulation,Information Systems
Reference46 articles.
1. Latora V, Nicosia V, Russo G. Complex networks: principles, methods and applications. Cambridge: Cambridge University Press; 2017. https://doi.org/10.1017/9781316216002.
2. Newman M. Networks. 2nd ed. Oxford: Oxford University Press; 2018.
3. Bilal K, Manzano M, Erbad A, Calle E, Khan SU. Robustness quantification of hierarchical complex networks under targeted failures. Comput Electr Eng. 2018;72:112–24. https://doi.org/10.1016/j.compeleceng.2018.09.008.
4. Dekker AH, Colbert BD. Network robustness and graph topology. In: Proceedings of the 27th Australasian conference on computer science, vol 26. ACSC ’04. Australian Computer Society, Inc., Darlinghurst, Australia; 2004. p. 359–68. http://dl.acm.org/citation.cfm?id=979922.979965.
5. Iyer S, Killingback T, Sundaram B, Wang Z. Attack robustness and centrality of complex networks. PLoS ONE. 2013;8(4):1–17. https://doi.org/10.1371/journal.pone.0059613.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献