Nonnegative chainable matrices and Kolmogorov's condition
Consider a non-negative matrix \(A=(a_{ik})\). Two positive entries \(a_{ik}\) and \(a_{pq}\) are said to form a link if either \(i=p\) or \(k=q\), i.e., the entries are in either the same row or the same column. The matrix \(A\) is said to be chainable if any two positive entries can be connected by a sequence of linked positive elements, and it is said to be indecomposobale if there is no permutation matrix \(P\) such that \(PAP^{-1}\) is block triangular. The main result of the present paper is that a non-negative matrix is indecomposable and chainable if and only if it satisfies Kolmogorov's condition, under which the Markov chain determined by a stochastic matrix satisfies the multidimensional local limit theorem. The authors also study further properties of indecomposable chainable matrices, and examples of such matrices.
- Combinatorial properties of entire semigroups of nonnegative matrices
- scientific article; zbMATH DE number 3143985 (Why is no real title available?)
- scientific article; zbMATH DE number 3054857 (Why is no real title available?)
- scientific article; zbMATH DE number 3058284 (Why is no real title available?)
- Nonnegative chainable matrices
- Problems Involving Diagonal Products in Nonnegative Matrices
- The chainable matrix, a special combinatorial matrix
- Nonnegative chainable matrices
- Non-negative matrices and Markov chains.
- Conditional negativity of anti-Loewner matrices
- Stable-recurrent non-negative matrices
- Chains of dog-ears for completely positive matrices
- An upper bound for the chainable index
- Frobenius and Sylvester inequalities for the chainable rank
- Algebraically chainable matrices and their properties
- Linear bijective maps preserving the chainable index
This page was built for publication: Nonnegative chainable matrices and Kolmogorov's condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146529)
