Recognizing linear structure in noisy matrices
From MaRDI portal
Publication:556892
DOI10.1016/j.laa.2004.12.023zbMath1077.15019OpenAlexW1964689037MaRDI QIDQ556892
Publication date: 23 June 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.12.023
Eigenvalues, singular values, and eigenvectors (15A18) Large deviations (60F10) Random matrices (algebraic aspects) (15B52)
Related Items
On spectra of spectra, The expected adjacency and modularity matrices in the degree corrected stochastic block model, On the spectrum of noisy blown-up matrices, Testability of minimum balanced multiway cut densities, Matrix and discrepancy view of generalized random and quasirandom graphs, Noisy random graphs and their laplacians, Modularity spectra, eigen-subspaces, and structure of weighted graphs, Generalized quasirandom properties of expanding graph sequences, Singular value decomposition of large random matrices (for two-way classification of microarrays)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering large graphs via the singular value decomposition
- On the distribution of the roots of certain symmetric matrices
- The eigenvalues of random symmetric matrices
- Spectra and optimal partitions of weighted graphs
- Eigenvalues of random power law graphs
- Distribution of the eigenvalues of random block-matrices.
- Emergence of Scaling in Random Networks
- Robustness and Vulnerability of Scale-Free Random Graphs
- The Maximum Degree of the Barabási–Albert Random Tree
- Fast computation of low rank matrix approximations