Characterization of symmetric M-matrices as resistive inverses

We aim here at characterizing those nonnegative matrices whose inverse is an irreducible Stieltjes matrix. Specifically, we prove that any irreducible Stieltjes matrix is a resistive inverse. To do that we consider the network defined by the off-diagonal entries of the matrix and we identify the matrix with a positive definite Schrodinger operator which ground state is determined by the its lowest eigenvalue and the corresponding positive eigenvector. We also analyze the case in which the operator is positive semidefinite which corresponds to the study of singular irreducible symmetric M-matrices. The key tool is the definition of the effective resistance with respect to a nonnegative value and a weight. We prove that these effective resistances verify similar properties to those satisfied by the standard effective resistances which leads us to carry out an exhaustive analysis of the generalized inverses of singular irreducible symmetric M-matrices. Moreover we pay special attention on those generalized inverses identified with Green operators, which in particular includes the analysis of the Moore-Penrose inverse.

[1]  Miroslav Fiedler,et al.  Special Ultrametric Matrices and Graphs , 2000, SIAM J. Matrix Anal. Appl..

[2]  Michael Neumann,et al.  The M-Matrix Group Generalized Inverse Problem for Weighted Trees , 1998 .

[3]  Richard S. Varga,et al.  A Linear Algebra Proof that the Inverse of a Strictly UltrametricMatrix is a Strictly Diagonally Dominant Stieltjes Matrix , 1994 .

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

[5]  Pavel Yu. Chebotarev,et al.  The Forest Metric for Graph Vertices , 2006, ArXiv.

[6]  Fuji Zhang,et al.  Resistance distance and the normalized Laplacian spectrum , 2007, Discret. Appl. Math..

[7]  I. Gutman,et al.  Resistance distance and Laplacian spectrum , 2003 .

[8]  C. Dellacherie,et al.  Ultrametric Matrices and Induced Markov Chains , 1996 .

[9]  I. Gutman,et al.  Generalized inverse of the Laplacian matrix and some applications , 2004 .

[10]  Bryan L. Shader,et al.  Distances in Weighted Trees and Group Inverse of Laplacian Matrices , 1997, SIAM J. Matrix Anal. Appl..

[11]  George P. H. Styan,et al.  Inequalities and equalities associated with the campbell-youla generalized inverse of the indefinite admittance matrix of resistive networks , 1997 .

[12]  Miroslav Fiedler,et al.  SOME CHARACTERIZATIONS OF SYMMETRIC INVERSE M-MATRICES , 1998 .

[13]  Richard S. Varga,et al.  Generalized ultrametric matrices — a class of inverse M-matrices , 1995 .

[14]  Ravindra B. Bapat,et al.  Resistance matrix of a weighted graph , 2004 .

[15]  Ravindra B. Bapat,et al.  A q-analogue of the distance matrix of a tree , 2006 .

[16]  Andrés M. Encinas,et al.  Potential Theory for Schrödinger operators on finite networks , 2005 .

[17]  R. Balaji,et al.  On Euclidean distance matrices , 2007 .

[18]  Hans Schneider,et al.  Inverse M-Matrix Inequalities and Generalized Ultrametric Matrices , 1995 .

[19]  Enrique Bendito Pérez,et al.  Potential Theory for boundary value problems on finite networks , 2006 .

[20]  T. Raghavan,et al.  Nonnegative Matrices and Applications , 1997 .