Recognizing linear structure in noisy matrices
From MaRDI portal
Recommendations
- Identification of linear relations from noisy data: Geometrical aspects
- Publication:4892193
- Identification of linear systems from noisy data
- scientific article; zbMATH DE number 218675
- scientific article; zbMATH DE number 37094
- Reconstruction of a low-rank matrix in the presence of Gaussian noise
- Identification of the maximal number of linear relations from noisy data
- scientific article; zbMATH DE number 851959
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Statistical Inferences of Linear Forms for Noisy Matrix Completion
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3745227 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Clustering large graphs via the singular value decomposition
- Distribution of the eigenvalues of random block-matrices.
- Eigenvalues of random power law graphs
- Emergence of Scaling in Random Networks
- Fast computation of low rank matrix approximations
- On the distribution of the roots of certain symmetric matrices
- Robustness and Vulnerability of Scale-Free Random Graphs
- Spectra and optimal partitions of weighted graphs
- The Maximum Degree of the Barabási–Albert Random Tree
- The eigenvalues of random symmetric matrices
Cited in
(12)- Identification of the maximal number of linear relations from noisy data
- Testability of minimum balanced multiway cut densities
- On spectra of spectra
- Matrix and discrepancy view of generalized random and quasirandom graphs
- Numerical results on noisy blown-up matrices
- On the spectrum of noisy blown-up matrices
- Noisy random graphs and their laplacians
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Recovering the structure of random linear graphs
- Generalized quasirandom properties of expanding graph sequences
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- Modularity spectra, eigen-subspaces, and structure of weighted graphs
This page was built for publication: Recognizing linear structure in noisy matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556892)