A cycle-based bound for subdominant eigenvalues of stochastic matrices

DOI10.1080/03081080701669309zbMath1168.15015MaRDI QIDQ3625587

Stephen J. Kirkland

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

zbMATH Keywords

directed graph; Leslie matrices; subdominant eigenvalue; Google-type matrices; primitive stochastic matrix

Mathematics Subject Classification ID

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

• A note on the eigenvalues of a primitive matrix with large exponent
• Geometric bounds for eigenvalues of Markov chains
• Non-negative matrices and Markov chains.
• An Eigenvalue Region for Leslie Matrices
• Combinatorial Matrix Theory
• Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer