Bounds for the Perron root using max eigenvalues (Q2479514): Difference between revisions

Let \(A = (a_{ik})\) be a nonnegative matrix of order \(n\) with no zero row and row sums \(r_i (A),i = 1,\dots,n, G(A)\) be the directed graph of \(A\), and \(\rho (A)\) be the Perron root of \(A\). \(\gamma\) is a simple cycle of length \(q\) described by a sequence of distinct integers \(i_1 ,\dots,i_q \in \{ 1,\dots,n\}\) for which \(a_{i_1 i_2 } ,\dots,a_{i_{q - 1} i_q } ,a_{i_q i_1 }\) are positive and \(C(A)\) denotes the set of all simple cycles in \(G(A)\). The main result of this paper is a new proof (based on techniques of max algebra) of Al'pin's inequalities: \[ \min \left\{ {\left( {\prod\nolimits_{i \in \gamma } {r_i (A)} } \right){\kern 1pt} ^{1/\left| \gamma \right| } \,\,:\gamma \in C(A)} \right\} \leqslant \rho (A) \leqslant \max \left\{ {\left( {\prod\nolimits_{i \in \gamma } {r_i (A)} } \right){\kern 1pt} ^{1/\left| \gamma \right| } \,\,:\gamma \in C(A)} \right\}. \] If \(A\) is irreducible, then eithe both inequalities hold with equality or both are strict. If \(A\) has zero main diagonal entries, then these bounds may improve the classical row sum bounds and this is illustrated by a generalized tournament matrix.