Abstract
Complex networks are robust to random failures; but not always to targeted attacks. The resilience of complex networks towards different node targeted attacks are studied immensely in the literature. Many node attack strategies were also proposed, and their efficiency was compared. However, in each of these proposals, the scientists used different measures of efficiency. So, it doesn’t seem easy to compare them and choose the one most suitable for the system under examination. Here, we review the main results from the literature on centrality based node attack strategies. Our focus is only on the works on undirected and unweighted networks. We want to highlight the necessity of a more realistic measure of attack efficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aharony, A., Stauffer, D.: Introduction to Percolation Theory. Taylor and Francis (1992). https://doi.org/10.1201/9781315274386
Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000). https://doi.org/10.1038/35019019
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002). https://doi.org/10.1103/RevModPhys.74.47
Bellingeri, M., Cassi, D., Vincenzi, S.: Efficiency of attack strategies on complex model and real-world networks. Phys. A Stat. Mech. Appl. 414 (2014). https://doi.org/10.1016/j.physa.2014.06.079
Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85, 5468–5471 (2000). https://doi.org/10.1103/PhysRevLett.85.4626
Cohen, R., Erez, K., Ben-Avraham, D., Havlin, S.: Breakdown of the internet under intentional attack. Phys. Rev. Lett. 86, 3682–3685 (2001). https://doi.org/10.1103/PhysRevLett.86.3682
Crucitti, P., Latora, V., Marchiori, M.: Efficiency of scale-free networks: error and attack tolerance. Phys. A 320, 622–642 (2003). https://doi.org/10.1016/S0378-4371(02)01545-5
Crucitti, P., Latora, V., Marchiori, M.: Model for cascading failures in complex networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 69, 045104 (2004). https://doi.org/10.1103/PhysRevE.69.045104
Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Proceedings of the Meeting on Algorithm Engineering and Experiments, pp. 90–100 (2008). http://dl.acm.org/citation.cfmid=2791204.2791213
He, S., Li, S., Ma, H.: Effect of edge removal on topological and functional robustness of complex networks. Phys. A 388, 2243–2253 (2009). https://doi.org/10.1016/j.physa.2009.02.007
Holme, P., Kim, B.J., Yoon, C.N., Han, S.K.: Attack vulnerability of complex networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 65(5 Pt 2), 056109 (2002). https://doi.org/10.1103/PhysRevE.65.056109
Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8 (2013). https://doi.org/10.1371/journal.pone.0059613
Lekha, D.S., Balakrishnan, K.: Central attacks in complex networks: a revisit with new fallback strategy. Phys. A Stat. Mech. Appl. 549 (2020). https://doi.org/10.1016/j.physa.2020.124347
Motter, A.E., Lai, Y.C.: Cascade-based attacks on complex networks. Phys. Rev. E. Stat. Nonlinear Soft Matter Phys. 66(6 Pt 2), 065102 (2002). https://doi.org/10.1103/PhysRevE.66.065102
Motter, A.E.: Cascade control and defense in complex networks. Phys. Rev. Lett. 93, 098701 (2004). https://doi.org/10.1103/PhysRevLett.93.098701
Nguyen, Q., Pham, H.D., Cassi, D., Bellingeri, M.: Conditional attack strategy for real-world complex networks. Phys. A Stat. Mech. Appl. 530 (2019). https://doi.org/10.1016/j.physa.2019.121561
Nie, T., Guo, Z., Zhao, K., Lu, Z.: New attack strategies for complex networks. Phys. A Stat. Mech. Appl. 424 (2015). https://doi.org/10.1016/j.physa.2015.01.004
Nie, T., Guo, Z., Zhao, K., Lu, Z.: The dynamic correlation between degree and betweenness of complex network under attack. Phys. A 457, 129–137 (2016). https://doi.org/10.1016/j.physa.2016.03.075
Reuven, C., Erez, K., Ben-Avraham, D., Havlin, S.: Resilience of the internet to random breakdowns. Phys. Rev. Lett. 85, 4626–4628 (2000). https://doi.org/10.1103/PhysRevLett.85.4626
Wandelt, S., Sun, X., Feng, D., Zanin, M.: A comparative analysis of approaches to network-dismantling. Sci. Rep. 8, 13513 (2018). https://doi.org/10.1038/s41598-018-31902-8
Acknowledgement
This work was funded by the IIT Palakkad Technology IHub Foundation Doctoral Fellowship IPTIF/HRD/DF/019. We also acknowledge the three anonymous reviewers for giving us constructive feedback.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
John, J.M., Lekha, D.S. (2022). Need for a Realistic Measure of Attack Severity in Centrality Based Node Attack Strategies. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications X. COMPLEX NETWORKS 2021. Studies in Computational Intelligence, vol 1072. Springer, Cham. https://doi.org/10.1007/978-3-030-93409-5_70
Download citation
DOI: https://doi.org/10.1007/978-3-030-93409-5_70
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93408-8
Online ISBN: 978-3-030-93409-5
eBook Packages: EngineeringEngineering (R0)