Structural vulnerability and robustness in complex networks: Different approaches and relationships between them

Springer Optimization and Its Applications

Volumn 58, Issue , 2012, Pages 3-36

  Criado, Regino ^a   Romance, Miguel ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84978890708     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-1-4614-0857-4_1     Document Type: Chapter

References (114)

1. Agarwal, J., Blockley, D.I. and Woodman, N.J.: Vulnerability of systems. Civil Eng. and Env. Syst. 18, 14165 (2001)
2. Agarwal, J., Blockley, D.I. andWoodman, N.J.: Vulnerability of structural systems. Structural Safety 25, 263286 (2003)
3. Albert, R., Albert, I., Nakarado, G.L.: Structural vulnerability of the North American power grid. Phys. Rev. E 69, 025103 (2004)
4. Albert, R. and Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
5. Albert, R., Jeong, H. and Barabási, A.L.: Diameter of the world-wide web. Nature 401, 130–131 (1999)
6. Albert, R., Jeong, H. and Barabási, A.L.: Error and attack tolerance of complex networks. Nature 406, 378 (2000)
7. Amaral, L. A. N. and Ottino, J. M.: Complex networks. European Physical Journal B, 38, 147–162 (2004)
8. Arenas, A., Danon, L., Daz-Guilera, A., Gleiser, P.M. and Guimer, R.: Community analysis in social networks. Eur. Phys. Journal B, 38 373–380 (2004)
9. Bao, Z.J., Cao, Y.J., Ding, L.J. and Wang, G.Z.: Comparison of cascading failures in smallworld and scale-free networks subject to vertex and edge attacks. Physica A, 388, 4491–4498 (2009)
10. Barabási, A.L. and Albert, R.: Emergence of scaling in random networks, Science 286, 509–512 (1999)
11. Barefoot, C.A., Entringer, R. and Swart, H.: Vulnerability in graphs a comparative survey. J.Comb.Math.and Comb.Comput. 1, 13–22 (1987)
12. Bar-Yam, Y.: Dynamics of ComplexSystems. Addison-Wesley, 1997.
13. Berdica, K.: An introduction to road vulnerability: what has been done, is done and should be done. Transport Policy 9(2), 117–127 (2002)
14. Biggs, N.: Algebraic Graph Theory, 2nd Edition. Cambridge University Press, 1993.
15. Boccaletti, S., Buldú, J., Criado, R., Flores, J., Latora, V., Pello, J., Romance, M.: Multi-scale Vulnerability of Complex Networks. Chaos 17, 043110 (2007)
16. Boccaletti, S., Criado, R., Pello, J., Romance, M., Vela-Pérez, M.: Vulnerability and fall of efficiency in complex networks: A new approach with computational advantages. Int. J. Bifurcat. Chaos 19(2), 727–735 (2009)
17. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex Networks: Structure and Dynamics. Phys. Rep, 424, 175 (2006)
18. Boguña, M., Serrano, M.: Generalized percolation in random directed networks. Phys. Rev. E 72, 016106 (2005)
19. Bollobás, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge, 2001
20. Bonacich, P.: Factoring and weighing approaches to status scores and clique information. J. Math. Soc. 2, 113 (1972)
21. Bonacich, P., Lloyd, P.: Eigenvectors-like measures of centrality for asymetric relations. Soc. Netw. 23, 191 (2001)
22. Boyd, C., Mathuria, A.: Protocols for Authentication and Key Establishment (Information Security and Cryptography). Springer (2003)
23. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. 30, 107 (1998).
24. Castro, M., Costa, M., Rowstron, A.: Should We Build Gnutella on a Structured Overlay. ACM SIGCOMM Computer Communications Review 34(1), 131136 (2004)
25. Chung, F.R.K.: Spectral Graph Theory. Conference Board of the Mathematical Sciences, AMS, Providence, RI, 92 (1997)
26. Chung, F.R.K., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Proc. Natl. Acad. Sci. 100 6313–6318, (2003)
27. Cohen, R., Erez, K., ben-Avraham, D., Havril, S.: Resilience of the internet to random breakdowns. Phys. Rev. Lett. 85(21), 4626 (2000)
28. Cohen, R., Erez, K., ben-Avraham, D., Havril, S.: Breakdown of the internet under intentional attacks. Phys. Rev. Lett. 86(16), 3682 (2001)
29. Comellas, F., Gago, S.: Spectral bounds for the betweenness of a graph. Linear Algebra Appl. 423, 74–80 (2007)
30. Comellas, F., Gago, S.: Synchronizability of complex networks, J. Phys. A: Math. Theor. 40, 4483–4492 (2007)
31. Criado, R., Flores, J., González-Vasco, M.I., Pello, J.: Locating a leader node on a complex network. J. Comput. Appl. Math. 204, 10 (2007)
32. Criado, R., García del Amo, A., Flores, J., Romance, M.: Analytical relationships between metric and centrality measures of a network and its dual. J. Comput. Appl. Math. 235, 1775–1780 (2011)
33. Criado, R., Flores, J., Pello, J., Romance, M.: Optimal communication schemes in a complex network: From trees to bottleneck networks. Eur. Phys. J.-Spec. Top. 146, 145–157 (2007)
34. Criado, R., García del Amo, A., Hernández-Bermejo, B., Romance, M.: New results on computable efficiency and its stability for complex networks. J. Comput. Appl. Math. 192, 59 (2006)
35. Criado, R., Flores, J., Hernández-Bermejo, B., Pello, J., Romance, M.: Effective measurement of network vulnerability under random and intentional attacks. J. Math. Model. Alg. 4, 307–316 (2005)
36. Criado, R., Hernández-Bermejo, B., Romance, M.: Efficiency, vulnerability and cost: an overview with applications to subway networks worldwide. Int. J. Bifurcat. Chaos 17(7), 2289 (2007)
37. Criado, R., Hernández-Bermejo, B., Marco-Blanco, J. Romance, M.: Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model. Int.J. Comput. Math. 85(3-4), 411–419 (2008)
38. Criado, R., Pello, J., Romance, M., Vela-Pérez, M.: A node based multi-scale vulnerability of Complex Networks. Int. J. Bifurcat. Chaos 19(2), 703–710 (2009)
39. Criado, R., Pello, J., Romance, M., Vela-Pérez, M.: (Ψ, p,q)-Vulnerabilities: An unified approach to network robustness. Chaos 19, 013133 (2009)
40. Criado, R., Pello, J., Romance, M., Vela-Pérez, M.: Improvements in performance and security for complex networks. Int. J. of Comp. Math., 86, 2, 209–218 (2009)
41. Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Efficiency of Scale-Free Networks: Error and Attack Tolerance. Physica A, 320, 622 (2003)
42. Crucitti, P., Latora V., Marchiori, M.: Error and attack tolerance of complex networks. Physica A 340 388–394 (2004)
43. Cvetkovic, D., Doob, M., Gutman, I., Torgasev, A.: Recent Results in the Theory of Graph Spectra, North-Holland, Amsterdam, 1988.
44. Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs, Theory and Applications, 3rd edn. Johann Ambrosius Barth, Heidelberg, 1995
45. Cvetkovic, D., Rowlinson, P.S.K. Simic: Eigenspaces of Graphs. Cambridge University Press, Cambridge, 1997.
46. Dekker, A.H., Colbert, B.D.: Network Robustness and Graph Topology. Proc. ACSC04, the 27th Australasian Computer Science Conference (18-22 January 2004), Dunedin, New Zealand (2004)
47. Diestel, R.: Graph Theory. Springer-Verlag (2005)
48. Dorogovtsev, S.N., Mendes J.F.F.: Evolution of networks. Adv. Phys. 51, 10791187 (2002)
49. Erdös, P., Rénji, A.: On Random Graphs I, Publ. Math. 6, 290–297 (1959)
50. Estrada, E.: Network robustness to targeted attacks. The interplay of expansibility and degree distribution. Eur. Phys. J.B., 52, 563–574 (2006)
51. Estrada, E., Rodríguez-Velázquez, J.: Subgraph centrality in complex networks. Phys. Rev. E 71, 056103 (2005)
52. Farkas, I.J., Derenyi, I., Barabási, A.-L. and Vicsek, T.: Spectra of realworld graphs: beyond the semicircle law. Physical Review E, 64:026704 (2001)
53. Fiedler, M.: Algebraic Connectivity of Graphs. Czech. Math. J. 23, 298 (1973)
54. Fontoura Costa, L. et al: Characterization of Complex Networks: A Survey of measurements. Advances in Physics, 56, 167–242 (2007)
55. Fontoura Costa, L. et al: Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications. arXiv:0711.3199v3 [physics.soc-ph] (2008)
56. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41, 1977.
57. Fuhrmann, T.: On the Topology of Overlay Networks. In Proceedings of 11th IEEE International Conference on Networks (ICON), pp. 271–276 (2003)
58. Gago, S.: Spectral Techniques in Complex Networks. Selectec Topics on Applications of Graph Spectra, Matematicki Institut SANU, Beograd, 14(22), 63–84, 2011.
59. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press (1985)
60. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)
61. Godsil, C.D. and Royle, G.: Algebraic Graph Theory. Springer, 2001.
62. Goh, K.-I. Kahng, B. and Kim, D.: Spectra and eigenvectors of scale-free networks. Physical Review E, 64:051903 (2001)
63. Goldshtein, V., Koganov, G.A and Surdutovich, G.I.: Vulnerability and hierarchy of complex networks. cond-mat/0409298 (2004)
64. Guellner, C. and Costa, C.H.: A Framework for Vulnerability Management in Complex Networks. IEEE Ultra Modern Telecommunications, ICUMT.09, 1–8 (2009)
65. Harary, F.: Graph Theory. Perseus, Cambridge, MA. (1995)
66. Holme, P., Beom Jun Kim, Chang No Yoon, Seung Kee Han: Attack vulnerability of complex networks. Phys. Rev. E 65, 056109 (2002)
67. Holmgren, J.: Using graph models to analyze the vulnerability of electric power networks. Risk Anal. 26(4), (2006)
68. Husdal, J.: Reliability and vulnerability versus cost and benefits. Proc. 2nd Int. Symp. Transportation Network Reliability (INSTR). Christchurch, New Zealand, 180–186 (2004)
69. Jamakovic, A., Van Mieghem, P.: On the robustness of complex networks by using the algebraic connectivity. NETWORKING 2008, LCNS 4892, 183–194, 2008.
70. Jamakovic, A., Uhlig, S.: On the relationship between the algebraic connectivity and graphs robustness to node and link failures, Proc. 3rd EURO-NGI Conf. Next Generation Internet Network, Trondheim, Norway, 96–102 (2007)
71. Jeong, H., Mason, S., Barabási, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411, 41–42 (2001)
72. Juh ãz, F.: The asymptotic behaviour of Fiedlers algebraic connectivity for random graphs. Discrete Mathematics 96, 59–63 (1991)
73. Koschitzki, D., Lehmann, K. A., Peeters, L., Richter, S., Tenfelde-Podehl, D. and Zlotowski, O.: Centrality indices. LNCS 3418, 2005.
74. Latora, V., Marchiori, M.: Efficient Behavior of Small-World Networks. Phys. Rev. Lett. 87, 198701 (2001)
75. Latora, V., Marchiori, M.: Economic small-world behaviour in weighted networks. Eur. Phys. J.B. 32, 249–263 (2003)
76. Latora, V., Marchiori, M.: How the science of complex networks can help developing strategies against terrorism. Chaos Solitons Fract. 20, 69 (2004)
77. Latora, V., Marchiori, M.: Vulnerability and protection of critical infrastructures. Phys Rev E 71, 015103 (2004)
78. Latora, V., Marchiori, M.: A measure of centrality based on the network efficiency. New J. Phys. 9, 188 (2007)
79. Lu, Z., Yu, Y., Woodman, N.J., Blockley, D.I.: A theory of structural vulnerability. Struct. Eng. 77(18), 17–24 (1999)
80. Mehta, M.L.: Random Matrices. Academic Press, 1991.
81. Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96–115, (1927)
82. Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197-198, 143–176 (1994)
83. Merris, R.: A survey of graph Laplacians. Linear and Multilinear Algebra 39, 19–31 (1995)
84. Mishkovski, I., Biey, M. and Kocarev, L.: Vulnerability of Complex Networks. Commun Nonlinear Sci Numer Simulat 16, 341–349 (2011)
85. Mohar, B.: The Laplacian spectrum of graphs. Graph Theory, Combinatorics and Applications 2, 871–898 (1991)
86. Mohar, B.: Eigenvalues, diameter and mean distance in graphs. Graphs Combin. 7, 53–64 (1991)
87. Mohar, B.: Laplace eigenvalues of graphs: a survey. Discrete Mathematics 109, 198, 171–183 (1992)
88. Mohar, B., Hahn, G., Sabidussi, G.: Some applications of Laplace eigenvalues of graphs. Graph Symmetry: Algebraic Methods and Applications, NATO ASI Ser. C 497, 225–275 (1997)
89. Motter, A.E., Lai, Y-C.: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102(R)(2002)
90. Motter, A.E.: Cascade control and defense in complex networks. Phys. Rev. Lett. 93, 098701 (R)(2004)
91. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
92. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)
93. Newman, M.E.J.: Networks: An Introduction. Oxford Univ. Press, Oxford, 2010
94. Newman, M.E.J., Barabási, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Univ. Press, Princeton, New Jersey (2006)
95. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
96. Newman, M.E.J., Goshal, G.: Bicomponents and the robustness of networks to failure, Phys. Rev. Lett. 100, 138701 (2008)
97. Ouyang, M. et al.: A methodological approach to analyze vulnerability of interdependent infrastructures, Simulation Modelling Practice and Theory 17, 817–828 (2009)
98. Rodríguez-Velázquez, J., Estrada, E., Gutiérrez, A.: Functional centrality in graphs. Linear and Multilinear Algebra 55(3), 293–302 (2007)
99. Rosato, V. and Tiriticco, F.: Growth mechanisms of the AS-level internet network. Europhysics Letters, 66(4):471–477 (2004)
100. Schwartz, N., Cohen, R., ben Avraham, D., Barabasi, A.L., Havlin, S.: Percolation in directed scale-free networks. Phys. Rev. E 66, 015104(R) (2002)
101. Seary, A. J. and Richards, W.D.: Spectral methods for analyzing and visualizing networks: an introduction. In Dynamic Social Network Modeling and Analysis, pages 209–228. National Academy Press, 2003.
102. Serrano, M., Boguña, M.: Clustering in complex networks. ii. percolation properties. Phys. Rev. E 74, 56115 (2006)
103. Strogatz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)
104. Taylor, M.A.P., D’Este, G.M.D.: Network Vulnerability: An Approach to Reliability Analysis at the Level of National Strategic Transport Networks. Proc. 1st Int.Symp. on Transportation Network Reliability, 23–44 (2003)
105. Taylor, M.A.P., D’Este, G.M.D.: Concepts of network vulnerability and applications to the identification of critical elements of transport infrastructure. Paper presented at the 26th Australasian Transport Research Forum, Wellington, New Zealand, 1-3 October 2003
106. Trpevski, D., Smilkov, D., Mishkovski, I. and Kocarev, L.: Vulnerability of labeled networks. Physica A 389, 23, 5538–5549(2010)
107. Van Mieghem, P.: Performance Analysis of Communications Networks and Systems. Cambridge University Press, Cambridge, 2006.
108. Wang, Y., Chakrabarti, D., Wang, C., Faloutsos, C.: Epidemic spreading in real networks: An eigenvalue viewpoint. 22nd Symp. Reliable Distributed Computing, Florence, Italy, Oct. 68, 2003.
109. Wasserman, S., Faust, K.: Social Networks Analysis. Cambridge Univ. Press (1994)
110. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)
111. Wehmuth, K. et al: On the joint dynamics of network diameter and spectral gap under node removal. Latin-American Workshop on Dynamic Networks, Buenos Aires (2010)
112. Wu, J., Deng, H.Z., Tan, Y.J. and Zhu, D.Z.: Vulnerability of complex networks under intentional attack with incomplete information. Journal of Physics A: Mathematical and Theoretical, 40, 11, 2665–2671 (2007)
113. Yazdani, A., Jeffrey, P.: Complex network analysis of water distribution systems, to appear in Chaos (2011)
114. Yazdani, A., Jeffrey, P.: A note on measurement of network vulnerability under random and intentional attacks. e-print: http://arxiv.org/abs/1006.2791 (2010)