Spectral distribution of the sample covariance of high-dimensional time series with unit roots

2022 ◽  
Author(s):  
Alexei Onatski ◽  
Chen Wang
Entropy ◽  
2019 ◽  
Vol 22 (1) ◽  
pp. 55 ◽  
Author(s):  
Mengyu Xu ◽  
Xiaohui Chen ◽  
Wei Biao Wu

This paper is concerned with the estimation of time-varying networks for high-dimensional nonstationary time series. Two types of dynamic behaviors are considered: structural breaks (i.e., abrupt change points) and smooth changes. To simultaneously handle these two types of time-varying features, a two-step approach is proposed: multiple change point locations are first identified on the basis of comparing the difference between the localized averages on sample covariance matrices, and then graph supports are recovered on the basis of a kernelized time-varying constrained L 1 -minimization for inverse matrix estimation (CLIME) estimator on each segment. We derive the rates of convergence for estimating the change points and precision matrices under mild moment and dependence conditions. In particular, we show that this two-step approach is consistent in estimating the change points and the piecewise smooth precision matrix function, under a certain high-dimensional scaling limit. The method is applied to the analysis of network structure of the S&P 500 index between 2003 and 2008.


2015 ◽  
Vol 04 (04) ◽  
pp. 1550019 ◽  
Author(s):  
Edgar Dobriban

Models from random matrix theory (RMT) are increasingly used to gain insights into the behavior of statistical methods under high-dimensional asymptotics. However, the applicability of the framework is limited by numerical problems. Consider the usual model of multivariate statistics where the data is a sample from a multivariate distribution with a given covariance matrix. Under high-dimensional asymptotics, there is a deterministic map from the distribution of eigenvalues of the population covariance matrix (the population spectral distribution or PSD), to the of empirical spectral distribution (ESD). The current methods for computing this map are inefficient, and this limits the applicability of the theory. We propose a new method to compute numerically the ESD from an arbitrary input PSD. Our method, called SPECTRODE, finds the support and the density of the ESD to high precision; we prove this for finite discrete distributions. In computational experiments SPECTRODE outperforms existing methods by orders of magnitude in speed and accuracy. We apply it to compute expectations and contour integrals of the ESD, which are often central in applications. We also illustrate that SPECTRODE is directly useful in statistical problems, such as estimation and hypothesis testing for covariance matrices. Our proposal, implemented in open source software, may broaden the use of RMT in high-dimensional data analysis.


Sign in / Sign up

Export Citation Format

Share Document