Recognizing linear structure in noisy matrices

DOI10.1016/J.LAA.2004.12.023MaRDI QIDQ556892zbMATH OpenOpenAlexFDO

Authors Marianna Bolla

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

zbMATH Keywords

blow-up matriceslarge deviationsperturbations of eigenvaluesrandom matrixWigner noise

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Large deviations (60F10)

Review text

A Wigner-noise is a random \(n\times n\) matrix that is symmetric, with the entries being independent mean zero, with uniformly bounded variance, and such that they are either uniformly bounded or Gaussian. The author [Linear Algebra Appl. 377, 219-240 (2004; Zbl 1042.15014)] studied the asymptotic behaviour of the eigenvalues of a symmetric block matrix perturbed by a Wigner-noise. In the paper under review, he extends the analysis to the case of blow-up matrices. Similar estimates are obtained for the perturbed eigenvalues, and for noisy weighted graphs. Cases where the blow-up matrix can be recognized from the perturbed matrix are analyzed.

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

• 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
• 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?)
• 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 eigenvalues of random symmetric matrices
• The Maximum Degree of the Barabási–Albert Random Tree

Cited in

(12)

• Singular value decomposition of large random matrices (for two-way classification of microarrays)
• The expected adjacency and modularity matrices in the degree corrected stochastic block model
• Recovering the structure of random linear graphs
• On the spectrum of noisy blown-up matrices
• Modularity spectra, eigen-subspaces, and structure of weighted graphs
• On spectra of spectra
• Testability of minimum balanced multiway cut densities
• Numerical results on noisy blown-up matrices
• Generalized quasirandom properties of expanding graph sequences
• Identification of the maximal number of linear relations from noisy data
• Matrix and discrepancy view of generalized random and quasirandom graphs
• Noisy random graphs and their laplacians

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)