Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Robustness assessment of complex networks using the idle network

Marcus Engsig*

Alejandro Tejedor†

Yamir Moreno‡

  • Department of Science and Engineering, Sorbonne University Abu Dhabi, Abu Dhabi, United Arab Emirates and Directed Energy Research Centre, Technology Innovation Institute, Abu Dhabi, United Arab Emirates

  • Department of Science and Engineering, Sorbonne University Abu Dhabi, Abu Dhabi, United Arab Emirates and Department of Civil and Environmental Engineering, University of California, Irvine, Irvine, California 92697, USA

  • Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018 Zaragoza, Spain; Department of Theoretical Physics, University of Zaragoza, Zaragoza 50009, Spain; and CENTAI Institute, Turin 10138, Italy

  • *marcus.w.engsig@gmail.com
  • †alej.tejedor@gmail.com
  • ‡yamir.moreno@gmail.com

Phys. Rev. Research 4, L042050 – Published 26 December, 2022

DOI: https://doi.org/10.1103/PhysRevResearch.4.L042050

Abstract

Network robustness is an essential system property to sustain functionality in the face of failures or targeted attacks. Currently, only the connectivity of the nodes resilient to an attack is used to assess robustness. We propose to incorporate the properties of the emerging connectivity of the nodes that are affected by the attack (idle network), which is demonstrated to contain relevant information about network robustness, improving the accuracy of its assessment. Our work shows that the information contained in the idle network offers a potential to generalize models, enabling them to estimate robustness for unseen attacks.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (38)

  1. D. J. Watts and S. H. Strogatz, Collective dynamics of small-world networks, Nature (London) 393, 440 (1998).
  2. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).
  3. M. Newman, Networks: An Introduction (Oxford University Press, Inc., New York, NY, USA, 2010).
  4. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: Structure and dynamics, Phys. Rep. 424, 175 (2006).
  5. A. Barrat, M. Barthlemy, and A. Vespignani, Dynamical Processes on Complex Networks, 1st ed. (Cambridge University Press, New York, NY, USA, 2008).
  6. I. Rodriguez-Iturbe and A. Rinaldo, Fractal River Basins: Chance and Self-Organization, 2nd ed (Cambridge Univ Press, New York, 2001), p. 547.
  7. E. Bullmore and O. Sporns, Complex brain networks: Graph theoretical analysis of structural and functional systems, Nat. Rev. Neurosci. 10, 186 (2009).
  8. M. Kivela, A. Arenas, M. Barthelemy, J. P. Gleeson, Y. Moreno, and M. A. Porter, Multilayer networks, Journal of Complex Networks 2, 203 (2014).
  9. A. Tejedor, A. Longjas, D. Edmonds, T. Georgiou, I. Zaliapin, A. Rinaldo, and E. Foufoula-Georgiou, Entropy and optimality in river deltas, Proc. Natl. Acad. Sci. USA 114, 11651 (2017).
  10. R. V. Solé, M. Rosas-Casals, B. Corominas-Murtra, and S. Valverde, Robustness of the european power grids under intentional attack, Phys. Rev. E 77, 026102 (2008).
  11. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, Resilience of the Internet to Random Breakdowns, Phys. Rev. Lett. 85, 4626 (2000).
  12. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, Breakdown of the Internet under Intentional Attack, Phys. Rev. Lett. 86, 3682 (2001).
  13. D. R. Wuellner, S. Roy, and R. M. D'Souza, Resilience and rewiring of the passenger airline networks in the united states, Phys. Rev. E 82, 056101 (2010).
  14. C. M. Schneider, A. A. Moreira, J. S. Andrade, S. Havlin, and H. J. Herrmann, Mitigation of malicious attacks on networks, Proc. Natl. Acad. Sci. 108, 3838 (2011).
  15. F. Radicchi and G. Bianconi, Redundant Interdependencies Boost the Robustness of Multiplex Networks, Phys. Rev. X 7, 011013 (2017).
  16. G. Bertagnolli, R. Gallotti, and M. De Domenico, Quantifying efficient information exchange in real network flows, Commun. Phys. 4, 125 (2021).
  17. R. Albert, H. Jeong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature 406, 378 (2000).
  18. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Network Robustness and Fragility: Percolation on Random Graphs, Phys. Rev. Lett. 85, 5468 (2000).
  19. P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, Attack vulnerability of complex networks, Phys. Rev. E 65, 056109 (2002).
  20. A. E. Motter and Y.-C. Lai, Cascade-based attacks on complex networks, Phys. Rev. E 66, 065102 (2002).
  21. S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, Catastrophic cascade of failures in interdependent networks, Nature (London) 464, 1025 (2010).
  22. B. Min, S. D. Yi, K.-M. Lee, and K.-I. Goh, Network robustness of multiplex networks with interlayer degree correlations, Phys. Rev. E 89, 042811 (2014).
  23. M. Bellingeri and D. Cassi, Robustness of weighted networks, Physica A 489, 47 (2018).
  24. A. Ghavasieh, G. Bertagnolli, and M. D. Domenico, Dismantling the information flow in complex interconnected systems (2022), arXiv:2202.09692.
  25. A. Tejedor, A. Longjas, I. Zaliapin, S. Ambroj, and E. Foufoula-Georgiou, Network robustness assessed within a dual connectivity framework: Joint dynamics of the active and idle networks, Sci. Rep. 7, 8567 (2017).
  26. S. Trajanovski, J. Martín-Hernández, W. Winterbach, and P. Van Mieghem, Robustness envelopes of networks, Journal of Complex Networks 1, 44 (2013).
  27. M. Ventresca and D. Aleman, Network robustness versus multi-strategy sequential attack, Journal of Complex Networks 3, 126 (2015).
  28. M. J. Williams and M. Musolesi, Spatio-temporal networks: Reachability, centrality and robustness, R. Soc. Open Sci. 3, 160196 (2016).
  29. O. Cats and P. Krishnakumari, Metropolitan rail network robustness, Physica A 549, 124317 (2020).
  30. P. Erdős and A. Rényi, On random graphs I, Publicationes Mathematicae Debrecen 6, 290 (1959).
  31. M. Catanzaro, M. Boguñá, and R. Pastor-Satorras, Generation of uncorrelated random scale-free networks, Phys. Rev. E 71, 027103 (2005).
  32. See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevResearch.4.L042050 for extended results corresponding to the complete set of experiments performed in this work.
  33. I. J. Goodfellow, Y. Bengio, and A. Courville, Deep Learning (MIT Press, Cambridge, MA, USA, 2016).
  34. T. Chakraborty, A. K. Chakraborty, and S. Chattopadhyay, A novel distribution-free hybrid regression model for manufacturing process efficiency improvement, J. Comput. Appl. Math. 362, 130 (2019).
  35. R. Iten, T. Metger, H. Wilming, L. del Rio, and R. Renner, Discovering Physical Concepts with Neural Networks, Phys. Rev. Lett. 124, 010508 (2020).
  36. N. D. Martinez, Artifacts or attributes? effects of resolution on the little rock lake food web, Ecological Monographs 61, 367 (1991).
  37. B. Szalkai, C. Kerepesi, B. Varga, and V. Grolmusz, The budapest reference connectome server v2.0, Neurosci. Lett. 595, 60 (2015).
  38. V. Colizza, R. Pastor-Satorras, and A. Vespignani, Reaction–diffusion processes and metapopulation models in heterogeneous networks, Nat. Phys. 3, 276 (2007).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation