Advertisement

On the Complexity of Color-Avoiding Site and Bond Percolation

  • Roland MolontayEmail author
  • Kitti Varga
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11376)

Abstract

The mathematical analysis of robustness and error-tolerance of complex networks has been in the center of research interest. On the other hand, little work has been done when the attack-tolerance of the vertices or edges are not independent but certain classes of vertices or edges share a mutual vulnerability. In this study, we consider a graph and we assign colors to the vertices or edges, where the color-classes correspond to the shared vulnerabilities. An important problem is to find robustly connected vertex sets: nodes that remain connected to each other by paths providing any type of error (i.e. erasing any vertices or edges of the given color). This is also known as color-avoiding percolation.

In this paper, we study various possible modeling approaches of shared vulnerabilities, we analyze the computational complexity of finding the robustly (color-avoiding) connected components. We find that the presented approaches differ significantly regarding their complexity.

Keywords

Computational complexity Color-avoiding percolation Robustly connected components Attack tolerance Shared vulnerability 

Notes

Acknowledgment

We thank Michael Danziger, Panna Fekete and Balázs Ráth for useful conversations. The research reported in this paper was supported by the BME- Artificial Intelligence FIKP grant of EMMI (BME FIKP-MI/SC). The publication is also supported by the EFOP-3.6.2-16-2017-00015 project entitled “Deepening the activities of HU-MATHS-IN, the Hungarian Service Network for Mathematics in Industry and Innovations” through University of Debrecen. The work of both authors is partially supported by the NKFI FK 123962 grant. R. M. is supported by NKFIH K123782 grant and by MTA-BME Stochastics Research Group.

References

  1. 1.
    Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406(6794), 378 (2000)CrossRefGoogle Scholar
  2. 2.
    Barabási, A.-L., et al.: Network Science. Cambridge University Press, Cambridge (2016)zbMATHGoogle Scholar
  3. 3.
    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(25), 5468 (2000)CrossRefGoogle Scholar
  4. 4.
    Dondi, R., Sikora, F.: Finding disjoint paths on edge-colored graphs: more tractability results. J. Comb. Optim. 36(4), 1315–1332 (2018)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: Kcore organization of complex networks. Phys. Rev. Lett. 96(4), 040601 (2006)CrossRefGoogle Scholar
  6. 6.
    Gavril, F.: Intersection graphs of Helly families of subtrees. Discrete Appl. Math. 66(1), 45–56 (1996)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gourves, L., Lyra, A., Martinhon, C.A., Monnot, J.: On paths, trails and closed trails in edge-colored graphs. Discrete Math. Theor. Comput. Sci. 14(2), 57–74 (2012)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Granata, D., Behdani, B., Pardalos, P.M.: On the complexity of path problems in properly colored directed graphs. J. Combin. Optim. 24(4), 459–467 (2012)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hackett, A., Cellai, D., Gómez, S., Arenas, A., Gleeson, J.P.: Bond percolation on multiplex networks. Phys. Rev. X 6(2), 021002 (2016)Google Scholar
  10. 10.
    Kadović, A., Krause, S.M., Caldarelli, G., Zlatic, V.: Bond and site color-avoiding percolation in scale free networks. arXiv preprint arXiv:1807.08553 (2018)
  11. 11.
    Kadović, A., Zlatić, V.: Color-avoiding edge percolation on edge-colored network. In: Complenet (2017)Google Scholar
  12. 12.
    Krause, S.M., Danziger, M.M., Zlatić, V.: Hidden connectivity in networks with vulnerable classes of nodes. Phys. Rev. X 6(4), 041022 (2016)Google Scholar
  13. 13.
    Krause, S.M., Danziger, M.M., Zlatić, V.: Color-avoiding percolation. Phys. Rev. E 96(2), 022313 (2017)CrossRefGoogle Scholar
  14. 14.
    Malaguti, E., Toth, P.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1), 1–34 (2010)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Newman, M.: Networks. Oxford University Press, Oxford (2018)CrossRefGoogle Scholar
  16. 16.
    Penrose, M.D.: On k-connectivity for a geometric random graph. Random Struct. Algorithms 15(2), 145–164 (1999)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Santos, R.F., Andrioni, A., Drummond, A.C., Xavier, E.C.: Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks. J. Combin. Optim. 33(2), 742–778 (2017)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Shao, S., Huang, X., Stanley, H.E., Havlin, S.: Percolation of localized attack on complex networks. New J. Phys. 17(2), 023049 (2015)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Shekhtman, L.M., et al.: Critical field-exponents for secure message-passing in modular networks. New J. Phys. 20(5), 053001 (2018)CrossRefGoogle Scholar
  20. 20.
    Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power laws and the AS-level internet topology. IEEE/ACM Trans. Netw. (TON) 11(4), 514–524 (2003)CrossRefGoogle Scholar
  21. 21.
    Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)zbMATHGoogle Scholar
  22. 22.
    Son, S.-W., Bizhani, G., Christensen, C., Grassberger, P., Paczuski, M.: Percolation theory on interdependent networks based on epidemic spreading. EPL (Europhys. Lett.) 97(1), 16006 (2012)CrossRefGoogle Scholar
  23. 23.
    Stauffer, D., Aharony, A.: Introduction to Percolation Theory: Revised Second Edition. CRC Press, Boca Raton (2014)CrossRefGoogle Scholar
  24. 24.
    Wu, B.Y.: On the maximum disjoint paths problem on edge-colored graphs. Discrete Optim. 9(1), 50–57 (2012)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Yuan, X., Dai, Y., Stanley, H.E., Havlin, S.: k-core percolation on complex networks: comparing random, localized, and targeted attacks. Phys. Rev. E 93(6), 062302 (2016)CrossRefGoogle Scholar
  26. 26.
    Zhao, L., Park, K., Lai, Y.-C., Ye, N.: Tolerance of scale-free networks against attack-induced cascades. Phys. Rev. E 72(2), 025104 (2005)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of StochasticsBudapest University of Technology and EconomicsBudapestHungary
  2. 2.MTA-BME Stochastics Research GroupBudapestHungary
  3. 3.Department of Computer Science and Information TheoryBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations