Browse > Article
http://dx.doi.org/10.7472/jksii.2015.16.5.39

Effect Analysis of an Additional Edge on Centrality and Ranking of Graph Using Computational Experiments  

Han, Chi-Geun (Dept. of Computer Engineering, Kyung Hee University)
Lee, Sang-Hoon (Dept. of Computer Engineering, Kyung Hee University)
Publication Information
Journal of Internet Computing and Services / v.16, no.5, 2015 , pp. 39-47 More about this Journal
Abstract
The centrality is calculated to describe the importance of a node in a graph and ranking is given according to the centrality for each node. There are many centrality measures and we use degree centrality, closeness centrality, eigenvector centrality, and betweenness centrality. In this paper, we analyze the effect of an additional edge of a graph on centrality and ranking through experimental computations. It is found that the effect of an additional edge on centrality and ranking of the nodes in the graph is different according to the graph structure using PCA. The results can be used for define the graph characteristics.
Keywords
centrality; ranking; graph; community;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Boldi and S. Vigna, "Axioms for Centrality", Social and Information Networks, Nov. 2013. http://dx.doi.org/10.1080/15427951.2013.865686   DOI
2 R. Lempel and S. Moran, "Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs", Information Retrieval, Vol. 8, No. 2, pp. 245-264, 2005. http://dx.doi.org/10.1007/s10791-005-5661-0   DOI
3 K. Avrachenkov and N. Litvak, "The Effect of New Links on Google Pagerank", Stochastic Models, 22 (2), pp. 319-331, 2006. http://dx.doi.org/10.1080/15326340600649052   DOI
4 J. Ronqui and T. Gonzalo, "Analyzing Complex Networks Through Correlations in Centrality Measurements", Social and Information Networks, June 2014. http://dx.doi.org/10.1088/1742-5468/2015/05/P05030   DOI
5 S. Borgatti, K. Carley and D. Krackhardt, "On the Robustness of Centrality Measures under Conditions of Imperfect Data", Social Networks 28.2, pp. 124-136, 2006. http://dx.doi.org/10.1016/j.socnet.2005.05.001   DOI
6 S. Segarra and A. Ribeiro, "Stability and Continuity of Centrality Measures in Weighted Graphs", Social and Information Networks, Oct. 2014. http://arxiv.org/abs/1410.5119
7 T. Chartier, E. Kreutzer, A. Langville, and K. Pedings, "Sensitivity and Stability of Ranking Vectors", SIAM J. Sci. Comput., 33(3), pp. 1077-1102, 2011. http://dx.doi.org/10.1137/090772745   DOI
8 A. Ng, A. Zheng and M. Jordan, "Stable Algorithms for Link Analysis", SIGIR '01 Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 258-266, 2001. http://dl.acm.org/citation.cfm?id=384003
9 P. Erdos and A. Renyl, "On Random Graphs, I", Publicationes Mathematicae 6, pp. 290-297, 1959. http://ftp.math-inst.hu/-p_erdos/1959-11.pdf
10 A.-L. Barabasi and R. Albert, "Emergence of Scaling in Random Networks", Science, 286, pp. 509-512, 1997. ISBN: 978-140084135-6;0691113572;978-069111357-9
11 I. Jolliffe, "Principal Component Analysis", Springer Series in Statistics, 2002. http://dx.doi.org/
12 W. Zachary, "An Information Flow Model for Conflict and Fission in Small Groups", J. of Anthropological Research 33, pp. 452-473, 1977. http://www.jstor.org/stable/3629752   DOI
13 D. Watts and S. Strogatz, "Collective Dynamics of 'Small-World' Networks", Nature, Vol. 393, No. 6684, pp. 440-442, 1998. http://dx.doi.org/10.1038/30918   DOI
14 D. Lusseau, K. Schneider, O. Boisseau, P. Haase, E. Slooten, and S. Dawson, "The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations", Behavioral Ecology and Sociobiology, Vol. 54, No. 4, pp 396-405, Sept. 2003. http://dx.doi.org/10.1007/s00265-003-0651-y   DOI
15 C. Correa, T. Crnovrsanin, and K. Ma, "Visual Reasoning about social networks using centrality sensitivity", IEEE Trans. on Visualization and Computer Graphics, Vol. 18, No. 1, pp. 106-120, 2012. http://dx.doi.org/10.1109/TVCG.2010.260   DOI