The Modified Increment Method for Eigenspace Model

Eigenspace is a convenient way to represent sets of observations with widespread applications, so it is necessary to accurately calculate the eigenspace of data. With the advent of the era of big data, the increasing and updating of data bring great challenges to the solution of eigenspace. Hall, et al. [1], proposed that the incremental method could update the eigenspace of data online, which reduces computational costs and storage space. In this paper, the updating coefficient of the sample covariance matrix in an incremental method is modified. Numerical analysis shows that the modified updating form has better performance.

Analysis of grid operation state based on improved maximum eigenvalue sample covariance matrix algorithm

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.

Tracy–Widom law for the largest eigenvalue of sample covariance matrix generated by VARMA

In this paper, we derive the Tracy–Widom law for the largest eigenvalue of sample covariance matrix generated by the vector autoregressive moving average model when the dimension is comparable to the sample size. This result is applied to make inference on the vector autoregressive moving average model. Simulations are conducted to demonstrate the finite sample performance of our inference.

Empirical likelihood test for a large-dimensional mean vector

Summary This paper is concerned with empirical likelihood inference on the population mean when the dimension $p$ and the sample size $n$ satisfy $p/n\rightarrow c\in [1,\infty)$. As shown in Tsao (2004), the empirical likelihood method fails with high probability when $p/n>1/2$ because the convex hull of the $n$ observations in $\mathbb{R}^p$ becomes too small to cover the true mean value. Moreover, when $p> n$, the sample covariance matrix becomes singular, and this results in the breakdown of the first sandwich approximation for the log empirical likelihood ratio. To deal with these two challenges, we propose a new strategy of adding two artificial data points to the observed data. We establish the asymptotic normality of the proposed empirical likelihood ratio test. The proposed test statistic does not involve the inverse of the sample covariance matrix. Furthermore, its form is explicit, so the test can easily be carried out with low computational cost. Our numerical comparison shows that the proposed test outperforms some existing tests for high-dimensional mean vectors in terms of power. We also illustrate the proposed procedure with an empirical analysis of stock data.