Stable-recurrent non-negative matrices

A finite or infinite square matrix \(Q\) with elements \(q_{ij}=q_{ij}^{(1)}\geq 0\), \(i,j\in\mathbb{N}\) is said to be indecomposable if for every pair \((i,j)\) there is an \(n\geq 1\) such that \(q_{ij}^{(n)}>0\) \((q_{ij}^{(n)}\) is the corresponding element of the matrix \(Q^n\)). An indecomposable matrix \(Q\) is said to be recurrent if for all \(i,j\in\mathbb{N}\) \(\sum_n q^{(n)}_{ij} [\lambda(Q)]^{-n}=\infty\), and positive-recurrent if for all \(i,j\in\mathbb{N}\) \(\varlimsup_{n\to\infty} q^{(n)}_{ij} [\lambda(Q)]^{-n}\neq 0\). [See \textit{D. Vere-Jones}, Q. J. Math. Oxf., II. Ser. 13 7-28 (1962; Zbl 0104.11805)]. The following definition is basic for the author. An indecomposable recurrent nonnegative matrix \(Q\) is said to be stable-recurrent if for any finite collection \(J\) of pairs \((i,j)\) satisfying the condition \(q_{ij}>0\) there is an \(\varepsilon>0\) such that by arbitrarily changing \(q_{ij}\) by at most \(\varepsilon\) for each of these pairs and leaving the remaining \(q_{ij}\) unchanged we again get a recurrent matrix. The goal of this note is to determine for nonnegative matrices some properties closely connected with stable recurrence, and, in particular equivalent to it [cf. \textit{I. A. Salama}, Pac. J. Math. 134, No. 2, 325-341 (1988; Zbl 0619.54031)].

Recommendations

Cited in

(8)

This page was built for publication: Stable-recurrent non-negative matrices

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