On comparison of the Perron-Frobenius eigenvalues of two ML-matrices (Q697064): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0024-3795(02)00314-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071736481 / rank | |||
Normal rank |
Latest revision as of 10:50, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On comparison of the Perron-Frobenius eigenvalues of two ML-matrices |
scientific article |
Statements
On comparison of the Perron-Frobenius eigenvalues of two ML-matrices (English)
0 references
12 September 2002
0 references
An ML-matrix is one whose off-diagonal elements are all nonnegative. By performing a limiting operation on a result of \textit{R. B. Bapat} [Am. Math. Mon. 96, 137-139 (1989; Zbl 0685.15007)], the author proves an inequality relating the Perron-Frobenius eigenvalues of two ML-matrices. He also proves an inequality comparing the values of \(x^T Ay\) and \(\lambda ^T B\mu\), where \(A\), \(B\) are ML-matrices and \(x\), \(y\), \(\lambda\), \(\mu\) are nonnegative vectors, and uses this to provide alternative proofs of the earlier results. An application to absorbing Markov chains is also discussed.
0 references
nonnegative matrices
0 references
Perron-Frobenius eigenvalue
0 references
Donsker-Varadhan characterization
0 references
information inequality
0 references
ML-matrix
0 references
absorbing Markov chains
0 references
0 references