SearcharxivSearch

arXiv · 2004.07226

On the asymptotic behaviour of the eigenvalue distribution of block correlation matrices of high-dimensional time series

Abstract

We consider linear spectral statistics built from the block-normalized correlation matrix of a set of $M$ mutually independent scalar time series. This matrix is composed of $M \times M$ blocks that contain the sample cross correlation between pairs of time series. In particular, each block has size $L \times L$ and contains the sample cross-correlation measured at $L$ consecutive time lags between each pair of time series. Let $N$ denote the total number of consecutively observed windows that are used to estimate these correlation matrices. We analyze the asymptotic regime where $M,L,N \rightarrow +\infty$ while $ML/N \rightarrow c_\star$, $0<c_\star<\infty$. We study the behavior of linear statistics of the eigenvalues of this block correlation matrix under these asymptotic conditions and show that the empirical eigenvalue distribution converges to a Marcenko-Pastur distribution. Our results are potentially useful in order to address the problem of testing whether a large number of time series are uncorrelated or not.

Explore related subjects

Keep this discovery

BibTeXRIS

Philippe Loubaton, Xavier Mestre. 2020-04-15. On the asymptotic behaviour of the eigenvalue distribution of block correlation matrices of high-dimensional time series. https://arxiv.org/abs/2004.07226

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR