K-path centrality: a new centrality measure in social networks

This paper proposes an alternative way to identify nodes with high betweenness centrality. It introduces a new metric, κ-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high κ-path centrality have high node betweenness centrality. Experimental evaluations on diverse real and synthetic social networks show improved accuracy in detecting high betweenness centrality nodes and significantly reduced execution time when compared to known randomized algorithms.

[1]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

[3]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[4]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[5]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[6]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[7]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[8]  Leon Peeters,et al.  Algorithms for Centrality Indices , 2004, Network Analysis.

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

[10]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

[12]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[13]  Neelima Gupte,et al.  Congestion and decongestion in a communication network. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Noah E. Friedkin,et al.  Horizons of Observability and Limits of Informal Control in Organizations , 1983 .

[15]  K. Goh,et al.  Betweenness centrality correlation in social networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[17]  J. Anthonisse.  The rush in a directed graph , 1971 .

[18]  Ian T. Foster,et al.  Small-world file-sharing communities , 2003, IEEE INFOCOM 2004.

[19]  Edward J. Wegman,et al.  Social networks of author-coauthor relationships , 2008, Comput. Stat. Data Anal..

[20]  A. Vázquez.  Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  María Guadalupe Ramírez Ortiz,et al.  The social networks of academic performance in a student context of poverty in Mexico , 2004, Soc. Networks.

[22]  Celso Grebogi,et al.  International Journal of Bifurcation and Chaos: Editorial , 2008 .

[23]  Ulrik Brandes,et al.  Centrality Measures Based on Current Flow , 2005, STACS.

[24]  Ben Y. Zhao,et al.  Measurement-calibrated graph models for social network experiments , 2010, WWW '10.

[25]  Jeffrey F. Naughton,et al.  Estimating the Size of Generalized Transitive Closures , 1989, VLDB.