SVD, discrepancy, and regular structure of contingency tables
From MaRDI portal
Publication:403553
DOI10.1016/j.dam.2014.03.022zbMath1300.05158arXiv1301.5259OpenAlexW2160001112MaRDI QIDQ403553
Publication date: 29 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5259
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)
Related Items (2)
Matrix and discrepancy view of generalized random and quasirandom graphs ⋮ Relating multiway discrepancy and singular values of nonnegative rectangular matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering large graphs via the singular value decomposition
- Limits of dense graph sequences
- Using discrepancy to control singular values for nonnegative matrices
- Lifts, discrepancy and nearly optimal spectral gap
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Quick approximation to matrices and applications
- Separation theorems for singular values of matrices and their applications in multivariate analysis
- Spectra and optimal partitions of weighted graphs
- Hermitian matrices and graphs: Singular values and discrepancy
- Biclustering in data mining
- Modularity spectra, eigen-subspaces, and structure of weighted graphs
- Biclustering via Sparse Singular Value Decomposition
- Fast monte-carlo algorithms for finding low-rank approximations
- Robust singular value decomposition analysis of microarray data
This page was built for publication: SVD, discrepancy, and regular structure of contingency tables