Some properties of ergodicity coefficients with applications in spectral graph theory
From MaRDI portal
Publication:5084719
DOI10.1080/03081087.2020.1777251zbMath1493.15116arXiv1911.06139OpenAlexW3034421244MaRDI QIDQ5084719
Publication date: 28 June 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.06139
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Ergodic theorems, spectral theory, Markov operators (37A30) Stochastic matrices (15B51)
Related Items (1)
Cites Work
- Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
- An improved upper bound for Laplacian graph eigenvalues
- An always nontrivial upper bound for Laplacian graph eigenvalues
- Non-negative matrices and Markov chains.
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- Ergodicity Coefficients Defined by Vector Norms
- A functional form for a particular coefficient of ergodicity
- Coefficients of ergodicity: structure and applications
- Sensitivity of the Stationary Distribution of a Markov Chain
- Gershgorin Disks for Multiple Eigenvalues of Non-negative Matrices
- On bounding the eigenvalues of matrices with constant row-sums
- Equivalence classes of e-matrices and associated eigenvalue localization regions
This page was built for publication: Some properties of ergodicity coefficients with applications in spectral graph theory