Tracy–Widom statistic for the largest eigenvalue of autoscaled real matrices
✍ Scribed by Edoardo Saccenti; Age K. Smilde; Johan A. Westerhuis; Margriet M. W. B. Hendriks
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 297 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0886-9383
- DOI
- 10.1002/cem.1411
No coin nor oath required. For personal study only.
✦ Synopsis
Eigenanalysis is common practice in biostatistics, and the largest eigenvalue of a data set contains valuable information about the data. However, to make inferences about the size of the largest eigenvalue, its distribution must be known. Johnstone's theorem states that the largest eigenvalues l 1 of real random covariance matrices are distributed according to the Tracy-Widom distribution of order 1 when properly normalized to L 1 ¼ l1À np
x np , where h np and j np are functions of the data matrix dimensions n and p. Very often, data are expressed in terms of correlations (autoscaling) for which case Johnstone's theorem does not work because the normalizing parameters h np and j np are not theoretically known. In this paper we propose a semi-empirical method based on test-equating theory to numerically approximate the normalization parameters in the case of autoscaled matrices. This opens the way of making inferences regarding the largest eigenvalue of an autoscaled data set. The method is illustrated by means of application to two real-life data sets.
📜 SIMILAR VOLUMES
New methods for the iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of a generalized eigenvalue problem are proposed. These methods use only multiplication of the A and B matrices on a vector. 0 1994 by John Wiley & Sons, Inc.