Asymptotic Analysis for Extreme Eigenvalues of Principal Minors of Random Matrices

05/21/2019
by   T. Tony Cai, et al.
0

Consider a standard white Wishart matrix with parameters n and p. Motivated by applications in high-dimensional statistics and signal processing, we perform asymptotic analysis on the maxima and minima of the eigenvalues of all the m × m principal minors, under the asymptotic regime that n,p,m go to infinity. Asymptotic results concerning extreme eigenvalues of principal minors of real Wigner matrices are also obtained. In addition, we discuss an application of the theoretical results to the construction of compressed sensing matrices, which provides insights to compressed sensing in signal processing and high dimensional linear regression in statistics.

READ FULL TEXT
research
07/29/2019

Principal components of spiked covariance matrices in the supercritical regime

In this paper, we study the asymptotic behavior of the extreme eigenvalu...
research
04/05/2016

Sparse Recovery Guarantees from Extreme Eigenvalues Small Deviations

This article provides a new toolbox to derive sparse recovery guarantees...
research
08/21/2020

Large Deviations of Extreme Eigenvalues of Generalized Sample Covariance Matrices

Very rare events in which the largest eigenvalue of a random matrix is a...
research
03/22/2019

Principal components in linear mixed models with general bulk

We study the outlier eigenvalues and eigenvectors in variance components...
research
02/19/2019

Asymptotic Theory of Eigenvectors for Large Random Matrices

Characterizing the exact asymptotic distributions of high-dimensional ei...
research
07/14/2018

Sparse Relaxed Regularized Regression: SR3

Regularized regression problems are ubiquitous in statistical modeling, ...
research
10/21/2020

On Compressed Sensing Matrices Breaking the Square-Root Bottleneck

Compressed sensing is a celebrated framework in signal processing and ha...

Please sign up or login with your details

Forgot password? Click here to reset