Using discrepancy to control singular values for nonnegative matrices

DOI10.1016/j.laa.2006.05.015zbMath1120.15007OpenAlexW1987992382MaRDI QIDQ865410

Steve Butler

Publication date: 14 February 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.05.015

zbMATH Keywords

discrepancysingular valuesdirected graphsalternating walks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20)

Related Items

Sharp spectral bounds of several graph parameters using eigenvector norms ⋮ From quasirandom graphs to graph limits and graphlets ⋮ SVD, discrepancy, and regular structure of contingency tables ⋮ Discrepancy inequalities for directed graphs ⋮ Matrix and discrepancy view of generalized random and quasirandom graphs ⋮ Discrepancy minimizing spectral clustering ⋮ Relating multiway discrepancy and singular values of nonnegative rectangular matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Hermitian matrices and graphs: Singular values and discrepancy
• Relating singular values and discrepancy of weighted directed graphs
• Quasi‐random graphs with given degree sequences

This page was built for publication: Using discrepancy to control singular values for nonnegative matrices