New circuit bounds for the Perron root of a nonnegative matrix (Q690607)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New circuit bounds for the Perron root of a nonnegative matrix |
scientific article |
Statements
New circuit bounds for the Perron root of a nonnegative matrix (English)
0 references
28 November 2012
0 references
This paper shows new two-sided bounds for the Perron root of a weakly irreducible nonnegative matrix, which depend on the circuits of length no less than two in the associated directed graph. Let \(A=(a_{ij}) \in \mathbb{R}^{n \times n}\) be a nonnegative matrix. \(\mathcal{C}(A)\) is the set of all simple circuits in the associated graph \(G(A)\). For a circuit \(\gamma \in \mathcal{C}(A)\), the author denotes by \(\bar{\gamma}\) and \(|\gamma|\) the set of vertices through which \(\gamma\) passes and the cardinality of \(\bar{\gamma}\), respectively. Furthermore, \(\mathcal{C}'(A)=\mathcal{C}(A-D_A)\), where \(D_A=\operatorname{diag}(a_{11},a_{22}, \dots, a_{nn})\), is the set of all simple circuits in \(G(A)\) of length no less than two. The main result of this manuscript establishes for a real weakly irreducible nonnegative matrix \(A=(a_{ij})\) that \[ \min_{\gamma \in \mathcal{C}'(A)} \left \{ \sum_{i \in \bar{\gamma}}a_{ii}/|\gamma|+w_A(\gamma) \right \} \leq \rho(A) \leq \max_{\gamma \in \mathcal{C}'(A)} \left \{ \max_{i \in \bar{\gamma}}\{a_{ii}\}+w_A(\gamma) \right \}, \] where \(w_A(\gamma)=\left[ \prod_{i \in \bar{\gamma}} r_i'(A)\right]^{1/|\gamma|}\) and \(r_i'(A)= \sum_{j=1, j \neq i}^n a_{ij}\). In addition, if \(A\) is irreducible, then the above inequalities are equalities if and only if the following conditions are satisfied: \(a_{11}=a_{22}=\dots=a_{nn}\equiv a\) and there exists a positive number \(w\) such that \(w_A(\gamma)=w\) for every \(\gamma \in \mathcal{C}'(A)\). Two approaches to derive circuit bounds are also considered.
0 references
irreducible nonnegative matrices
0 references
Perron root
0 references
directed graphs
0 references
simple circuit
0 references
two-sided bounds
0 references