On comparison of the Perron-Frobenius eigenvalues of two ML-matrices
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.
- Applications of an inequality in information theory to matrices
- Asymptotic properties of powers of nonnegative matrices, with applications
- Comparing the Spectral Radii of Two Nonnegative Matrices
- Convex spectral functions
- scientific article; zbMATH DE number 3437326 (Why is no real title available?)
- scientific article; zbMATH DE number 1514781 (Why is no real title available?)
- Lower bounds for the Perron root of a nonnegative matrix
- Markov chain models - rarity and exponentiality
- On a Variational Formula for the Principal Eigenvalue for Operators with Maximum Principle
This page was built for publication: On comparison of the Perron-Frobenius eigenvalues of two ML-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697064)