Resistance distance, closeness, and betweenness

Abstract In a seminal paper Stephenson and Zelen (1989) rethought centrality in networks proposing an information-theoretic distance measure among nodes in a network. The suggested information distance diverges from the classical geodesic metric since it is sensible to all paths (not just to the shortest ones) and it diminishes as soon as there are more routes between a pair of nodes. Interestingly, information distance has a clear interpretation in electrical network theory that was missed by the proposing authors. When a fixed resistor is imagined on each edge of the graph, information distance, known as resistance distance in this context, corresponds to the effective resistance between two nodes when a battery is connected across them. Here, we review resistance distance, showing once again, with a simple proof, that it matches information distance. Hence, we interpret both current-flow closeness and current-flow betweenness centrality in terms of resistance distance. We show that this interpretation has semantic, theoretical, and computational benefits.

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

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

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

[4]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[5]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[6]  Anthony Bonato,et al.  Introduction to the Special Issue on Algorithms and Models for the Web Graph , 2012, Internet Math..

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

[8]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[9]  Marco Rosa,et al.  Four degrees of separation , 2011, WebSci '12.

[10]  Yousef Saad,et al.  A Probing Method for Computing the Diagonal of the Matrix Inverse ∗ , 2010 .

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

[12]  M. Newman,et al.  Identifying the role that animals play in their social networks , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[13]  A. Shimbel.  Structural parameters of communication networks , 1953 .

[14]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[15]  Choujun Zhan,et al.  On the distributions of Laplacian eigenvalues versus node degrees in complex networks , 2010 .

[16]  Enrico Bozzo,et al.  Approximations of the Generalized Inverse of the Graph Laplacian Matrix , 2012, Internet Math..

[17]  Douglas J. Klein,et al.  Co-authorship, rational Erdős numbers, and resistance distances in graphs , 2004, Scientometrics.

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

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

[20]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[21]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

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

[23]  G. Golub,et al.  Matrices, Moments and Quadrature with Applications , 2009 .

[24]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[25]  Paul Erdös,et al.  On the Fundamental Problem of Mathematics , 1972 .

[26]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.