Abstract
This paper considers the problems of detecting a change point and estimating the location in the correlation matrices of a sequence of high-dimensional vectors, where the dimension is large enough to be comparable to the sample size or even much larger. A new break test is proposed based on signflip parallel analysis to detect the existence of change points. Furthermore, a two-step approach combining a signflip permutation dimension reduction step and a CUSUM statistic is proposed to estimate the change point’s location and recover the support of changes. The consistency of the estimator is constructed. Simulation examples and real data applications illustrate the superior empirical performance of the proposed methods. Especially, the proposed methods outperform existing ones for non-Gaussian data and the change point in the extreme tail of a sequence and become more accurate as the dimension p increases. Supplementary materials for this article are available online.
Funding Statement
Zhaoyuan Li’s research is partially supported by National Natural Science Foundation of China (No. 11901492) and Shenzhen Science and Technology Program (ZDSYS 20211021111415025).
Citation
Zhaoyuan Li. Jie Gao. "Efficient change point detection and estimation in high-dimensional correlation matrices." Electron. J. Statist. 18 (1) 942 - 979, 2024. https://doi.org/10.1214/24-EJS2221
Information