Advertisement

Identifying Vulnerable Nodes to Cascading Failures: Centrality to the Rescue

  • Richard J. La
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 812)

Abstract

We study the problem of identifying nodes that are more likely to trigger cascading failures in complex systems, which we call vulnerable nodes. We show that there is a close relation between the likelihood of a node setting off cascading failures (which we call the cascading failure probability) and its non-backtracking centrality; when every failed node is equally likely to cause the failure of each neighbor, the cascading failure probability and non-backtracking centrality of a node are proportional to each other. Based on this observation, we propose a new approach to finding vulnerable nodes and study its performance using numerical studies.

Keywords

Cascading failures Nonbacktracking centrality 

Notes

Acknowledgement

This work was supported in part by contract 70NANB16H024 from National Institute of Standards and Technology (NIST).

References

  1. 1.
    Albert, R., Jeong, H., Barabasi, A.L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)Google Scholar
  2. 2.
    Bollobas, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica 24(1), 5–34 (2004)Google Scholar
  3. 3.
    Krzakala, F., et al.: Spectral redemption: clustering sparse networks. Proc. Natl. Acad. Sci. 110(52), 20935–20940 (2013)Google Scholar
  4. 4.
    La, R.J.: Cascading failures in interdependent systems: impact of degree variability and dependence. IEEE Trans. Netw. Sci. Eng. 5(2), 127–140 (2018)Google Scholar
  5. 5.
    La, R.J.: Cascading failures in interdependent systems: impact of degree variability and dependence. IEEE Trans. Netw. Sci. Eng. (2018). https://doi.org/10.1109/TNSE.20189.2805720
  6. 6.
    Martin, T., Zhang, X., Newman, M.E.J.: Localization and centrality in networks. Phys. Rev. E 90(052808) (2014)Google Scholar
  7. 7.
    Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6(2–3), 161–180 (1995)Google Scholar
  8. 8.
    Molloy, M., Reed, B.: The size of the largest component of a random graph on a fixed degree sequence. Comb. Probab. Comput. 7(3), 295–305 (1998)Google Scholar
  9. 9.
    Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(208701) (2002)Google Scholar
  10. 10.
    Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67(026126) (2003)Google Scholar
  11. 11.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167–256 (2003)Google Scholar
  12. 12.
    Pastor-Satorras, R., Castellano, C.: Eigenvector localization in real networks and its implications for epidemic spreading. J. Stat. Phys. 1–14 (2018). https://doi.org/10.1007/s10955-018-1970-8
  13. 13.
    Yang, Y., Nishikawa, T., Motter, A.E.: Small vulnerable sets determine large network cascades in power grids. Science 358(6365) (2017)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.University of MarylandCollege ParkUSA

Personalised recommendations