Singular value decomposition of large random matrices (for two-way classification of microarrays) (Q1049547)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5656745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Singular value decomposition of large random matrices (for two-way classification of microarrays) |
scientific article; zbMATH DE number 5656745 |
Statements
Singular value decomposition of large random matrices (for two-way classification of microarrays) (English)
0 references
12 January 2010
0 references
A real matrix is called a blown up matrix if after rearranging its rows and columns, it consists of blocks of the same entries. The authors extend the study by \textit{M. Bolla} [Linear Algebra Appl. 402, 228--244 (2005; Zbl 1077.15019)] on large symmetric blown up matrices burdened with a so-called symmetric Wigner-noise to a general kind of noise. They analyze the asymptotic behavior of the singular value decomposition of blown up matrices and normalized blown up contingency tables exposed to random noise.
0 references
blown up matrix
0 references
noise matrix
0 references
random perturbation
0 references
two-way classification
0 references
microarray
0 references
correspondence matrix
0 references
random matrices
0 references
Wigner-noise
0 references
singular value decomposition
0 references
contingency tables
0 references
0 references
0.7894861102104187
0 references
0.7894861102104187
0 references
0.7787508964538574
0 references
0.7737339735031128
0 references
