Spectral measure of structural robustness in complex networks

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 41, Issue 6, 2011, Pages 1244-1252

  Wu, Jun ^a,b   Barahona, Mauricio ^b   Tan, Yue Jin ^a   Deng, Hong Zhong ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Complex networks; graph spectra; natural connectivity; structural robustness

Indexed keywords

ALTERNATIVE ROUTES; COMPLEX NETWORKS; EDGE-ELIMINATION; EIGEN-VALUE; GRAPH SPECTRA; MATHEMATICAL FORMULATION; NATURAL CONNECTIVITY; RANDOM GRAPHS; SCALE FREE NETWORKS; SPECTRAL MEASURE; STRUCTURAL ROBUSTNESS; WEIGHTED NUMBER;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 80054814199     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2011.2116117     Document Type: Article

References (52)

1. D. J. Watts and S. H. Strogatz, "Collective dynamics of "small-world" networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998.
2. A. L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, Oct. 1999.
3. Y.-K. Lin, "Reliability of k separate minimal paths under both time and budget constraints," IEEE Trans. Rel., vol. 59, no. 1, pp. 183-190, Mar. 2010.
4. Y.-K. Lin, "System reliability evaluation for a multistate supply chain network with failure nodes by using minimal paths," IEEE Trans. Rel., vol. 58, no. 1, pp. 34-40, Mar. 2009.
5. Y.-K. Lin, "Reliability evaluation for an information network with node failure under cost constraint," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 37, no. 2, pp. 180-188, Mar. 2007.
6. L. D. Xing, "An efficient binary-decision-diagram-based approach for network reliability and sensitivity analysis," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 38, no. 1, pp. 105-115, Jan. 2008.
7. P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, "Attack vulnerability of complex networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 65, no. 5, p. 056109, May 2002.
8. Y. Li, J.Wu, and A. Q. Zou, "Effect of eliminating edges on robustness of scale-free networks under intentional attack," Chin. Phys. Lett., vol. 27, no. 6, p. 068901, Jun. 2010.
9. Y. X. Xia and D. J. Hill, "Attack vulnerability of complex communication networks," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 55, no. 1, pp. 65-69, Jan. 2008.
10. J. W. Wang and L. L. Rong, "Cascade-based attack vulnerability on the U.S. power grid," Safety Sci., vol. 47, no. 10, pp. 1332-1336, Dec. 2009.
11. S. Xiao, G. Xiao, T. H. Cheng, S. Ma, X. Fu, and H. Soh, "Robustness of scale-free networks under rewiring operations," Europhys. Lett., vol. 89, no. 3, p. 38 002, 2010.
12. B. Hu, F. Li, and H.-S. Zhou, "Robustness of complex networks under attackandrepair," Chin. Phys. Lett., vol. 26, no. 12, p. 128 901, Dec. 2009.
13. H. Frank and I. T. Frisch, "Analysis and design of survivable network," IEEE Trans. Commun. Technol., vol. COM-18, no. 5, pp. 501-519, Oct. 1970.
14. D. Bauer, F. Boesch, C. Suffel, and R. Tindell, "Connectivity extremal problems and the design of reliable probabilistic networks," in The Theory and Application of Graphs. New York: Wiley, 1981, pp. 89-98.
15. F. Harary, "Conditional connectivity," Networks, vol. 13, pp. 346-357, 1983.
16. M. S. Krishnamoorthy and B. Krishnamurthy, "Fault diameter of interconnection networks," Comput. Math. Appl., vol. 13, no. 5/6, pp. 577-582, 1987.
17. V. Chvátal, "Tough graphs and Hamiltonian circuits," Discr. Math., vol. 5, no. 3, pp. 215-228, Jul. 1973.
18. H. A. Jung, "On a class of posets and the corresponding comparability graphs," J. Combin. Theory, Ser. B, vol. 24, no. 2, pp. 125-133, Apr. 1978.
19. M. Cozzen, D. Moazzami, and S. Stueckle, "The tenacity of a graph," in Proc. 7th Int. Conf. Theory Appl. Graphs, 1995, pp. 1111-1122.
20. N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
21. B. Mohar, "Isoperimetric number of graphs," J. Combin. Theory, Ser. B, vol. 47, no. 3, pp. 274-291, Dec. 1989.
22. M. Fiedler, "Algebraic connectivity of graphs," Czech. Math. J., vol. 23, no. 98, pp. 298-305, 1973.
23. R. Merris, "Laplacian matrices of graphs: A survey," Linear Algebra Appl., vol. 197/198, pp. 143-176, Jan./Feb. 1994.
24. B. Bollobás, Random Graphs. New York: Academic, 1985.
25. R. Albert, H. Jeong, and A. L. Barabási, "Error and attack tolerance of complex networks," Nature, vol. 406, no. 6794, pp. 378-382, Jul. 2000.
26. V. Latora and M. Marchiori, "Efficient behavior of small-world networks," Phys. Rev. Lett., vol. 87, no. 19, p. 198 701, Nov. 2001.
27. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, "Resilience of the Internet to random breakdowns," Phys. Rev. Lett., vol. 85, no. 21, pp. 4626-4628, Nov. 2000.
28. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, "Breakdown of the Internet under intentional attack," Phys. Rev. Lett., vol. 86, no. 16, pp. 3682-3685, Apr. 2001.
29. 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., vol. 85, no. 25, pp. 5468-5471, Dec. 2000.
30. J. Wu, H. Z. Deng, Y. J. Tan, and Y. Li, "A robustness model of complex networks with tunable attack information parameter," Chin. Phys. Lett., vol. 24, no. 7, pp. 2138-2141, Jul. 2007.
31. J. Wu, Y. J. Tan, H. Z. Deng, and D. Z. Zhu, "Vulnerability of complex networks under intentional attack with incomplete information," J. Phys. A, vol. 40, no. 11, pp. 2665-2671, Mar. 2007.
32. E. Estrada, "Characterization of 3D molecular structure," Chem. Phys. Lett., vol. 319, no. 5/6, pp. 713-718, Mar. 2000.
33. E. Estrada, "Characterization of the folding degree of proteins," Bioinformatics, vol. 18, no. 5, pp. 697-704, May 2002.
34. E. Estrada and J. A. Rodriacute;guez-Velázquez, "Subgraph centrality in complex networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 71, no. 5, p. 056 103, May 2005.
35. E. Estrada and J. A. Rodriacute;guez-Velázquez, "Spectral measures of bipartivity in complex networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 72, no. 4, p. 046 105, Oct. 2005.
36. E. Estrada, "Network robustness to targeted attacks: The interplay of expansibility and degree distribution," Eur. Phys. J. B, vol. 52, no. 4, pp. 563-574, Aug. 2006.
37. E. Estrada, "Spectral scaling and good expansion properties in complex networks," Europhys. Lett., vol. 73, no. 4, pp. 649-655, Feb. 2006.
38. D. M. Cvetkovi, M. Doob, and H. Sachs, Spectra of Graphs. NewYork: Academic, 1979.
39. M. Barahona and L. M. Pecora, "Synchronization in small-world systems," Phys. Rev. Lett., vol. 89, no. 5, p. 054 101, Jul. 2002.
40. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables. New York: Dover, 1972.
41. G. Dattoli, L. Giannessi, L. Mezi, and A. Torre, "Theory of generalized Bessel-functions," Nuovo Cimento Della Societa Italiana Di Fisica B-Gen. Phys. Relativity Astron. Math. Phys. Methods, vol. 105, no. 3, pp. 327-348, 1990.
42. G. Dattoli, C. Mari, A. Torre, C. Chiccoli, S. Lorenzutta, and G. Maino, "Analytical and numerical results on m-variable generalized Bessel functions," J. Sci. Comput., vol. 7, no. 2, pp. 175-196, Jun. 1992.
43. G. Dattoli and A. Torre, Theory and Applications of Generalized Bessel Functions. Rome, Italy: Aracne Editrice, 1996.
44. P. Erdös and A. Rényi, "On random graphs," Publicationes Mathematicae, vol. 6, pp. 290-297, 1959.
45. F. Chung, L. Y. Lu, and V. Vu, "Spectra of random graphs with given expected degrees," Proc. Nat. Acad. Sci. U.S.A., vol. 100, no. 11, pp. 6313-6318, May 2003.
46. M. Krivelevich and B. Sudakov, "The largest eigenvalue of sparse random graphs," Combin. Probab. Comput., vol. 12, no. 1, pp. 61-72, Jan. 2003.
47. E. Wigner, "Characteristic vectors of bordered matrices with infinite dimensions," Ann. Math., vol. 62, no. 3, pp. 548-564, 1955.
48. G. B. Arfken and H. J. Weber, Mathematical Methods for Physicists, 6th ed. San Diego, CA: Academic, 2005.
49. F. Chung and L. Y. Lu, "Connected components in random graphs with given expected degree sequences," Ann. Combin., vol. 6, no. 2, pp. 125-145, Nov. 2002.
50. M. E. J. Newman, S. H. Strogatz, and D. J. Watts, "Random graphs with arbitrary degree distributions and their applications," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 64, no. 2, p. 026 118, Aug. 2001.
51. J.Wu, Y. J. Tan, H. Z. Deng, D. Z. Zhu, and Y. Chi, "Relationship between degree-rank distributions and degree distributions of complex networks," Phys. A, vol. 383, no. 2, pp. 745-752, Sep. 2007.
52. S. Zhou, G. Q. Zhang, and G. Q. Zhang, "Chinese Internet AS-level topology," IET Commun., vol. 1, no. 2, pp. 209-214, Apr. 2007.