Fast nonasymptotic testing and support recovery for large sparse Toeplitz covariance matrices
نویسندگان
چکیده
We consider n independent p-dimensional Gaussian vectors with covariance matrix having Toeplitz structure. The aim is two-fold: to test that these have components against a stationary distribution sparse matrix, and also select the support of non-zero entries under alternative hypothesis. Our model assumes values occur in recent past (time-lag less than p/2). build procedures combine sum scan-type procedure, but are computationally fast, show their non-asymptotic behaviour both one-sided (only positive correlations) two-sided alternatives, respectively. exhibit selector significant lags bound Hamming-loss risk estimated support. These results can be extended case nearly structure sub-Gaussian vectors. Numerical illustrate excellent selectors — larger dimension p, faster rates.
منابع مشابه
Fast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملTwo-Sample Covariance Matrix Testing and Support Recovery in High-Dimensional and Sparse Settings
Two-Sample Covariance Matrix Testing and Support Recovery in High-Dimensional and Sparse Settings Tony Cai a , Weidong Liu b & Yin Xia a a Department of Statistics, The Wharton School, University of Pennsylvania, Philadelphia, PA, 19104 b Department of Mathematics, Institute of Natural Sciences and MOE-LSC, Shanghai Jiao Tong University, Shanghai, China Accepted author version posted online: 02...
متن کاملOn Testing for Diagonality of Large Dimensional Covariance Matrices
Datasets in a variety of disciplines require methods where both the sample size and the dataset dimensionality are allowed to be large. This framework is drastically different from the classical asymptotic framework where the number of observations is allowed to be large but the dimensionality of the dataset remains fixed. This paper proposes a new test of diagonality for large dimensional cova...
متن کاملConsistent Estimation of Large - Dimensional Sparse Covariance Matrices
Estimating covariance matrices is a problem of fundamental importance in multivariate statistics. In practice it is increasingly frequent to work with data matrices X of dimension n×p, where p and n are both large. Results from random matrix theory show very clearly that in this setting, standard estimators like the sample covariance matrix perform in general very poorly. In this “large n, larg...
متن کاملOperator norm consistent estimation of large dimensional sparse covariance matrices
Estimating covariance matrices is a problem of fundamental importance in multivariate statistics. In practice it is increasingly frequent to work with data matrices X of dimension n × p, where p and n are both large. Results from random matrix theory show very clearly that in this setting, standard estimators like the sample covariance matrix perform in general very poorly. In this “large n, la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2022
ISSN: ['0047-259X', '1095-7243']
DOI: https://doi.org/10.1016/j.jmva.2021.104883