A cycle-based bound for subdominant eigenvalues of stochastic matrices
From MaRDI portal
Publication:3625587
DOI10.1080/03081080701669309zbMath1168.15015MaRDI QIDQ3625587
Publication date: 5 May 2009
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: http://eprints.maynoothuniversity.ie/2191/1/SK_cycle_bound_revised.pdf
directed graph; Leslie matrices; subdominant eigenvalue; Google-type matrices; primitive stochastic matrix
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A42: Inequalities involving eigenvalues and eigenvectors
05C20: Directed graphs (digraphs), tournaments
15B51: Stochastic matrices
Related Items
On bounding the eigenvalues of matrices with constant row-sums, On equitable partition of matrices and its applications, An eigenvalue localization theorem for stochastic matrices and its application to Randić matrices, Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces, A modification of eigenvalue localization for stochastic matrices, A Geršgorin-type eigenvalue localization set with \(n\) parameters for stochastic matrices, Geršgorin-type and Brauer-type eigenvalue localization sets of stochastic matrices
Cites Work