Search arXivSearch

arXiv · 2212.05504

Correlation matrix of equi-correlated normal population: fluctuation of the largest eigenvalue, scaling of the bulk eigenvalues, and stock market

Abstract

Given an $N$-dimensional sample of size $T$ and form a sample correlation matrix $\mathbf{C}$. Suppose that $N$ and $T$ tend to infinity with $T/N $ converging to a fixed finite constant $Q>0$. If the population is a factor model, then the eigenvalue distribution of $\mathbf{C}$ almost surely converges weakly to Marčenko-Pastur distribution such that the index is $Q$ and the scale parameter is the limiting ratio of the specific variance to the $i$-th variable $(i\to\infty)$. For an $N$-dimensional normal population with equi-correlation coefficient $ρ$, which is a one-factor model, for the largest eigenvalue $λ$ of $\mathbf{C}$, we prove that $λ/N$ converges to the equi-correlation coefficient $ρ$ almost surely. These results suggest an important role of an equi-correlated normal population and a factor model in (Laloux et al. Random matrix theory and financial correlations, Int. J. Theor. Appl. Finance, 2000): the histogram of the eigenvalue of sample correlation matrix of the returns of stock prices fits the density of Marčenko-Pastur distribution of index $T/N $ and scale parameter $1-λ/N$. Moreover, we provide the limiting distribution of the largest eigenvalue of a sample covariance matrix of an equi-correlated normal population. We discuss the phase transition as to the decay rate of the equi-correlation coefficient in $N$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yohji Akama. 2023-03-08. Correlation matrix of equi-correlated normal population: fluctuation of the largest eigenvalue, scaling of the bulk eigenvalues, and stock market. https://arxiv.org/abs/2212.05504

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

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST