Approximations of the Generalized Inverse of the Graph Laplacian Matrix

We devise methods for finding approximations of the generalized inverse of the graph Laplacian matrix, which arises in many graph-theoretic applications. Finding this matrix in its entirety involves solving a matrix inversion problem, which is resource-demanding in terms of consumed time and memory and hence impractical whenever the graph is relatively large. Our approximations use only a few eigenpairs of the Laplacian matrix and are parametric with respect to this number, so that the user can compromise between effectiveness and efficiency of the approximate solution. We apply the devised approximations to the problem of computing current-flow betweenness centrality on a graph. However, given the generality of the Laplacian matrix, many other applications can be sought. We experimentally demonstrate that the approximations are effective already with a constant number of eigenpairs. These few eigenpairs can be stored with a linear amount of memory in the number of nodes of the graph, and in the realistic case of sparse networks, they can be efficiently computed using one of the many methods for retrieving a few eigenpairs of sparse matrices that abound in the literature.

[1]  Ran Raz,et al.  On the complexity of matrix product , 2002, STOC '02.

[2]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

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

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

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

[6]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

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

[8]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

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

[10]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  A. Rapoport,et al.  Connectivity of random nets , 1951 .

[14]  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.

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

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

[17]  M. Randic,et al.  Resistance distance , 1993 .

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

[19]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..

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

[21]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[22]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[23]  M. Putti,et al.  Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices , 2002 .

[24]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[25]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

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

[27]  H. Simon,et al.  ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS , 1955 .

[28]  B. Bollobás.  The evolution of random graphs , 1984 .

[29]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.