[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.9708/jksci.2017.22.03.061

Analysis of the network robustness based on the centrality of vertices in the graph

Jeong, Changkwon (Dept. of Computer Engineering, Kyung Hee University)
Han, Chi-Geun (Dept. of Computer Engineering, Kyung Hee University)
Lee, Sang-Hoon (Dept. of Computer Engineering, Kyung Hee University)

Publication Information

Journal of the Korea Society of Computer and Information / v.22, no.3, 2017 , pp. 61-67 More about this Journal

Abstract

This paper analyzes the robustness of the network based on the centrality of vertices in the graph. In this paper, a random graph is generated and a modified graph is constructed by adding or removing vertices or edges in the generated random graph. And then we analyze the robustness of the graph by observing changes in the centrality of the random graph and the modified graph. In the process modifying a graph, we changes some parts of the graph, which has high values of centralities, not in the whole. We study how these additional changes affect the robustness of the graph when changes occurring a group that has higher centralities than in the whole.

Keywords

Centrality; Community; Robustness;

Citations & Related Records

Reference

1	P. Boldi and S. Vigna, "Axioms for Centrality", Social and Information Networks, Nov. 2013.
2	Stephen P. Borgatti, Kathleen M. Carley and David Krackhardt, "On the Robustness of Centrality Measures under Conditions of Imperfect Data", Social Networks 28.2, pp.124-136, May. 2006. DOI
3	Diestel Reinhard, Graph Theory(3rd ed.), Berlin, New York: Springer-Velag, 2005.
4	Linton Freeman, "A set of measures of centrality based on betweenness", Sociometry. 40: 35-41, 1977. DOI
5	Sabidussi G., "The centrality index of a graph", Psychometrika. 31: 581-603, 1966. DOI
6	M. E. J. Newman, "The mathematics of networks", Nov. 2006.
7	P. Erdos and A. Renyi, "On random graphs I.", Publicationes Mathematicae. 6: 290-297, Nov. 1959.
8	Dekker A. H. and Colbert B. D., "Network robustness and graph topology", in Proceedings of 27th Australasian Computer Science Conference, pp. 359-368, 2004.