Abstract
Realization of highly tolerant networks against malicious attacks is an important issue, since many real-world networks are extremely vulnerable to attacks. Thus, we investigate the optimal robustness of connectivity against attacks on networks in changing degree distribution ranging from power-law to exponential or narrower ones. It is numerically found that the smaller variances of degree distributions lead to higher robustness in this range. Our results will provide important insights toward optimal robustness against attacks in changing degree distributions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albert, R., Jeong, H., Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)
Braunstein, A., Dall’Asta, L., Semerjian, G., Zdeborová, L.: Network dismantling. Proc. Nat. Acad. Sci. 113(44), 12368–12373 (2016). https://www.pnas.org/content/113/44/12368
Callaway, D.S., Hopcroft, J.E., Kleinberg, J.M., Newman, M.E.J., Strogatz, S.H.: Are randomly grown graphs really random? Phys. Rev. E 64(4), 041902 (Sep 2001). https://link.aps.org/doi/10.1103/PhysRevE.64.041902
Catanzaro, M., Boguñá, M., Pastor-Satorras, R.: Generation of uncorrelated random scale-free networks. Phys. Rev. E 71(2), 027103 (Feb 2005). https://link.aps.org/doi/10.1103/PhysRevE.71.027103
Chujyo, M., Hayashi, Y.: A loop enhancement strategy for network robustness. Appl. Netw. Sci. 6(1), 1–13 (2021)
Hayashi, Y., Uchiyama, N.: Onion-like networks are both robust and resilient. Sci. Rep. 8(1), 1–13 (2018)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Springer (1972)
Krapivsky, P.L., Redner, S.: Organization of growing random networks. Phys. Rev. E 63(6), 066123 (May 2001). https://link.aps.org/doi/10.1103/PhysRevE.63.066123
Krapivsky, P.L., Redner, S.: A statistical physics perspective on web growth. Comput. Netw. 39(3), 261–276 (2002). https://www.sciencedirect.com/science/article/pii/S1389128602002128
Krapivsky, P.L., Redner, S., Leyvraz, F.: Connectivity of growing random networks. Phys. Rev. Lett. 85(21), 4629–4632 (Nov 2000). https://link.aps.org/doi/10.1103/PhysRevLett.85.4629
Liao, F., Hayashi, Y.: Emergence of robust and efficient networks in a family of attachment models. Phys. A: Stat. Mech. Appl. 599, 127427 (2022). https://www.sciencedirect.com/science/article/pii/S0378437122003168
Mugisha, S., Zhou, H.J.: Identifying optimal targets of network attack by belief propagation. Phys. Rev. E 94(1), 012305 (Jul 2016). https://link.aps.org/doi/10.1103/PhysRevE.94.012305
Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (Oct 2002). https://link.aps.org/doi/10.1103/PhysRevLett.89.208701
Schneider, C.M., Moreira, A.A., Andrade, J.S., Havlin, S., Herrmann, H.J.: Mitigation of malicious attacks on networks. Proc. Nat Acad. Sci. 108(10), 3838–3841 (2011). https://www.pnas.org/content/108/10/3838
Tanizawa, T., Havlin, S., Stanley, H.E.: Robustness of onionlike correlated networks against targeted attacks. Phys. Rev. E 85(4), 046109 (Apr 2012). https://link.aps.org/doi/10.1103/PhysRevE.85.046109
Tanizawa, T., Paul, G., Havlin, S., Stanley, H.E.: Optimization of the robustness of multimodal networks. Phys. Rev. E 74(1), 016125 (Jul 2006). https://link.aps.org/doi/10.1103/PhysRevE.74.016125
Wu, Z.X., Holme, P.: Onion structure and network robustness. Phys. Rev. E 84(2), 026106 (Aug 2011). https://link.aps.org/doi/10.1103/PhysRevE.84.026106
Xulvi-Brunet, R., Sokolov, I.M.: Reshuffling scale-free networks: from random to assortative. Phys. Rev. E 70(6), 066102 (Dec 2004). https://link.aps.org/doi/10.1103/PhysRevE.70.066102
Zhou, H.J.: Spin glass approach to the feedback vertex set problem. Eur. Phys. J. B 86(11), 1–9 (2013)
Acknowledgements
This research is supported in part by JSPS KAKENHI Grant Number JP.21H03425.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chujyo, M., Hayashi, Y. (2023). Optimal Network Robustness in Continuously Changing Degree Distributions. In: Cherifi, H., Mantegna, R.N., Rocha, L.M., Cherifi, C., Micciche, S. (eds) Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016 2022. Studies in Computational Intelligence, vol 1078. Springer, Cham. https://doi.org/10.1007/978-3-031-21131-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-031-21131-7_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21130-0
Online ISBN: 978-3-031-21131-7
eBook Packages: EngineeringEngineering (R0)