Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
DOI10.1023/A:1021771612003zbMath1014.15013OpenAlexW1563173071MaRDI QIDQ4799984
Publication date: 31 March 2003
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30722
eigenvalueMarkov chainsweighted graphsirreducible nonnegative matrixLaplacian matricesaveraged minimal cut
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (1)
Cites Work
- Unnamed Item
- Laplace eigenvalues of graphs---a survey
- Laplacian matrices of graphs: A survey
- An estimate for the nonstochastic eigenvalues of doubly stochastic matrices
- On the structure of stochastic matrices with a subdominant eigenvalue near 1
- A survey of graph laplacians
- Inequalities: theory of majorization and its applications
This page was built for publication: Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices