Ranking of Closeness Centrality for Large-Scale Social Networks

Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to all other vertices in the graph. In this paper, we combine existing methods on calculating exact values and approximate values of closeness centrality and present new algorithms to rank the top-kvertices with the highest closeness centrality. We show that under certain conditions, our algorithm is more efficient than the algorithm that calculates the closeness-centralities of all vertices.

[1]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[2]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[3]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  M. V. Valkenburg.  Network Analysis , 1964 .

[5]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[6]  Dongwon Lee,et al.  On six degrees of separation in DBLP-DB and more , 2005, SGMD.

[7]  M. Newman.  1 Who is the best connected scientist ? A study of scientific coauthorship networks , 2004 .

[8]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[9]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[12]  Peter Sanders,et al.  Better Approximation of Betweenness Centrality , 2008, ALENEX.

[13]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[14]  David Eppstein,et al.  Fast approximation of centrality , 2000, SODA '01.

[15]  Ulrik Brandes,et al.  Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.

[16]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[17]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.

[18]  U. Brandes.  Faster Evaluation of Shortest-Path Based Centrality Indices , 2000 .

[19]  R. Rothenberg,et al.  Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs , 2002, Sexually transmitted infections.

[20]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[21]  Thomas W. Valente,et al.  The stability of centrality measures when networks are sampled , 2003, Soc. Networks.

[22]  M. Newman,et al.  Why social networks are different from other types of networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  M. Newman.  Coauthorship networks and patterns of scientific collaboration , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[25]  J. Potterat,et al.  HIV epidemicity in context of STI declines: a telling discordance , 2002, Sexually transmitted infections.