Some properties of ergodicity coefficients with applications in spectral graph theory

DOI10.1080/03081087.2020.1777251MaRDI QIDQ5084719zbMATH OpenOpenAlexFDO

Authors Rachid Marsli, Frank J. Hall

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

zbMATH Keywords

e-matriceseigenvaluesergodicity coefficientsLaplacian matrixstochastic matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Stochastic matrices (15B51) Ergodic theorems, spectral theory, Markov operators (37A30)

Abstract: The main result is Corollary 2.9 which provides upper bounds on, and even better, approximates the largest non-trivial eigenvalue in absolute value of real constant row-sum matrices by the use of vector norm based ergodicity coefficients Tp. If the constant row-sum matrix is nonsingular, then it is also shown how its smallest non-trivial eigenvalue in absolute value can be bounded by using Tp. In the last section, these two results are applied to bound the spectral radius of the Laplacian matrix as well as the algebraic connectivity of its associated graph. Many other results are obtained. In particular, Theorem 2.15 is a convergence theorem for Tp and Theorem 4.7 compares some ergodicity coefficients to each other.

Recommendations

• Ergodicity coefficients defined by vector norms
• scientific article; zbMATH DE number 2156209
• A note on certain ergodicity coefficients
• scientific article; zbMATH DE number 92917
• Explicit forms for ergodicity coefficients and spectrum localization

Cites work

• A functional form for a particular coefficient of ergodicity
• An always nontrivial upper bound for Laplacian graph eigenvalues
• An improved upper bound for Laplacian graph eigenvalues
• Coefficients of ergodicity: structure and applications
• Equivalence classes of e-matrices and associated eigenvalue localization regions
• Ergodicity coefficients defined by vector norms
• Gershgorin disks for multiple eigenvalues of non-negative matrices
• Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
• Non-negative matrices and Markov chains.
• On bounding the eigenvalues of matrices with constant row-sums
• Sensitivity of the Stationary Distribution of a Markov Chain
• Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices

Cited in

(3)

• Inclusion regions and bounds for the eigenvalues of matrices with a known eigenpair
• The minimum coefficient of ergodicity for a Markov chain with a given directed graph
• A note on certain ergodicity coefficients

This page was built for publication: Some properties of ergodicity coefficients with applications in spectral graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084719)