Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices (Q2568982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices |
scientific article; zbMATH DE number 2214851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices |
scientific article; zbMATH DE number 2214851 |
Statements
Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices (English)
0 references
17 October 2005
0 references
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.
0 references
ergodic Markov chain
0 references
diagonally dominant M-matrix
0 references
group inverse
0 references
Laplacian matrix
0 references
mean first passage times
0 references
M-matrix
0 references
nonnegative matrix
0 references
stochastic matrix
0 references
transition matrix
0 references
undirected weighted graph
0 references
triangle inequality
0 references
0 references
0 references
0 references
0 references
0.7863574624061584
0 references
0.7712807059288025
0 references
0.7712807059288025
0 references
0.7475236058235168
0 references
0.7424532175064087
0 references
