Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices

From MaRDI portal
Publication:2568982





The authors study finite ergodic Markov chains, Laplacian matrices of undirected weighted graphs, and inverses of strictly diagonally dominant M-matrices. Among other things, they connect and generalize properties of matrices related to (i) the triangle inequality for mean first passage times in finite homogeneous ergodic Markov chains, (ii) the triangle inequality for proximities in the Laplacian matrices of undirected weighted graphs, and (iii) the Metzler property of the column entrywise diagonal dominance of inverses of diagonally dominant M-matrices.











This page was built for publication: Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568982)