Node removal vulnerability of the largest component of a network

2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings

Volumn , Issue , 2013, Pages 587-590

  Chen, Pin Yu ^a   Hero, Alfred O ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Graph Laplacian; Greedy node removal; Network robustness; Spectral graph theory; Topological vulnerability

Indexed keywords

ASSOCIATED GRAPH; CONNECTIVITY STRUCTURES; GRAPH LAPLACIAN; MINIMIZATION PROBLEMS; NETWORK ROBUSTNESS; REMOVAL ALGORITHMS; SPECTRAL GRAPH THEORY; TOPOLOGICAL VULNERABILITY;

DATA PROCESSING; MATRIX ALGEBRA; NETWORK SECURITY; VECTOR SPACES;

GRAPH THEORY;

EID: 84897705146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GlobalSIP.2013.6736946     Document Type: Conference Paper

References (18)

1. R. Albert, H. Jeong, and A.-L. Barabási, "Error and attack tolerance of complex networks," Nature, vol. 406, no. 6794, pp. 378-382, July 2000.
2. T. G. Lewis, Network Science: Theory and Practice. John Wiley and Sons, Inc., 2008.
3. 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.
4. S. Xiao, G. Xiao, and T. H. Cheng, "Tolerance of intentional attacks in complex communication networks," IEEE Commun. Mag., vol. 45, no. 1, pp. 146-152, Feb. 2008.
5. R. V. Solé, M. Rosas-Casals, B. Corominas-Murtra, and S. Valverde, "Robustness of the European power grids under intentional attack," Phys. Rev. E, vol. 77, p. 026102, Feb. 2008.
6. P.-Y. Chen, S.-M. Cheng, and K.-C. Chen, "Smart attacks in smart grid communication networks," IEEE Commun. Mag., vol. 50, no. 8, pp. 24-29, Aug. 2012.
7. 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.
8. D. Alderson, L. Li, W. Willinger, and J. Doyle, "Understanding Internet topology: principles, models, and validation," IEEE/ACM Trans. Netw., vol. 13, no. 6, pp. 1205-1218, Dec. 2005.
9. A. A. Moreira, J. S. Andrade, H. J. Herrmann, and J. O. Indekeu, "How to make a fragile network robust and vice versa," Phys. Rev. Lett., vol. 102, p. 018701, Jan 2009.
10. L. Freeman, "A set of measures of centrality based on betweenness," Sociometry, vol. 40, pp. 35-41, 1977.
11. P. Holme, B. J. Kim, C. N. Yoon, and S. K. Han, "Attack vulnerability of complex networks," Phys. Rev. E, vol. 65, p. 056109, May 2002.
12. B. Mohar, "The Laplacian spectrum of graphs," in Graph Theory, Combinatorics, and Applications. New York: Wiley, 1991, pp. 871-898.
13. D. Cvetkovic, P. Rowlinson, and S. K. Simic, "Signless Laplacians of finite graphs," Linear Algebra and its Applications, vol. 423, no. 1, pp. 155-171, 2007.
14. M. Fiedler, "Algebraic connectivity of graphs," Czechoslovak Mathematical Journal, vol. 23, no. 98, pp. 298-305, 1973.
15. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge University Press, 1990.
16. T. F. Coleman and A. Pothen, "The null space problem I. complexity," SIAM J. Algebraic Discrete Methods, vol. 7, no. 4, pp. 527-537, Oct. 1986.
17. U. Luxburg, "A tutorial on spectral clustering," Statistics and Computing, vol. 17, no. 4, pp. 395-416, Dec. 2007.
18. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, no. 6684, pp. 440-442, June 1998.