Metraipolis › archive › dc_7615d949f7fd
Recursive Multiple Change Point Detection of Nonstationary Time Series: Instability Tests, Estimation and Confidence Intervals — arXiv:2608.13352
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13352
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:45:23.503Z
- SHA-256 of the archived text
94bdad7b5bc93abb3264c09445949319d9cc991e4101a33b8eb24909bbf4cf16- Stable URL of this page
https://metraipolis.com/documento/dc_7615d949f7fd
How to cite
Recursive Multiple Change Point Detection of Nonstationary Time Series: Instability Tests, Estimation and Confidence Intervals — arXiv:2608.13352 — arXiv (en), https://arxiv.org/abs/2608.13352 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7615d949f7fd (Metraipolis archive dc_7615d949f7fd, sha256 94bdad7b5bc93abb3264c09445949319d9cc991e4101a33b8eb24909bbf4cf16)
BibTeX
@misc{dc7615d949f7fd,
title = {Recursive Multiple Change Point Detection of Nonstationary Time Series: Instability Tests, Estimation and Confidence Intervals — arXiv:2608.13352},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13352},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7615d949f7fd; sha256 94bdad7b5bc93abb3264c09445949319d9cc991e4101a33b8eb24909bbf4cf16},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13352. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop bootstrap-assisted robust binary segmentation (BARBS), a recursive binary segmentation method for multiple change point detection under general nonstationary temporal dynamics. A novel Gaussian multiplier bootstrap for the CUSUM statistics is proposed, offering robustness to complex dependence structures. Through meticulous calibration of the critical values at each stage of the recursion, BARBS ensures control of the Type I error under the null hypothesis of no change points. When change points are present, BARBS identifies the correct number of changes with a prespecified probability, and the resulting change point location estimators attain the same uniform consistency rate as classical binary segmentation. Building on this, we introduce second-stage refined estimators that achieve the optimal individual localization rate, and establish their asymptotic distributions and nearly optimal uniform localization rates under both fixed and vanishing jump magnitudes. Extensive numerical experiments across various settings confirm the robustness and superior performance of BARBS relative to existing approaches. To illustrate the practical relevance of the proposed methodology, we analyze U.S. inflation data, yielding change points that align with several documented macroeconomic episodes. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-14 in stat.ME). Categorie arXiv: Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2608.13352 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:26:22.350Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).