Two-Sample Covariance Matrix Testing and Support Recovery in High-Dimensional and Sparse Settings

2013 ◽  
Vol 108 (501) ◽  
pp. 265-277 ◽  
Author(s):  
Tony Cai ◽  
Weidong Liu ◽  
Yin Xia
2012 ◽  
Vol 204-208 ◽  
pp. 4734-4737
Author(s):  
Shi Qing Wang ◽  
Fei Xia Song

Estimation of Population covariance matrix from samples is important in a wide range of areas of statistical analysis. In the estimation, the sample covariance matrix, which is the most natural and standard estimator, often performs badly. With the collection of large high-dimensional data in scientific investigation, the related covariance matrix becomes complicated to deal with. Therefore, for the convenience in computing and analyzing, we need to simplify the covariance matrix. This method is referred as regularization. In this paper, we will consider a proof for a construction of covariance regularization by tapering.


Author(s):  
Dinghui Wu ◽  
Juan Zhang ◽  
Bo Wang ◽  
Tinglong Pan

Traditional static threshold–based state analysis methods can be applied to specific signal-to-noise ratio situations but may present poor performance in the presence of large sizes and complexity of power system. In this article, an improved maximum eigenvalue sample covariance matrix algorithm is proposed, where a Marchenko–Pastur law–based dynamic threshold is introduced by taking all the eigenvalues exceeding the supremum into account for different signal-to-noise ratio situations, to improve the calculation efficiency and widen the application fields of existing methods. The comparison analysis based on IEEE 39-Bus system shows that the proposed algorithm outperforms the existing solutions in terms of calculation speed, anti-interference ability, and universality to different signal-to-noise ratio situations.


2013 ◽  
Vol 143 (11) ◽  
pp. 1887-1897 ◽  
Author(s):  
Weiming Li ◽  
Jiaqi Chen ◽  
Yingli Qin ◽  
Zhidong Bai ◽  
Jianfeng Yao

Sign in / Sign up

Export Citation Format

Share Document