Translator Disclaimer
November 2020 Bump detection in the presence of dependency: Does it ease or does it load?
Farida Enikeeva, Axel Munk, Markus Pohlmann, Frank Werner
Bernoulli 26(4): 3280-3310 (November 2020). DOI: 10.3150/20-BEJ1226

Abstract

We provide the asymptotic minimax detection boundary for a bump, i.e. an abrupt change, in the mean function of a stationary Gaussian process. This will be characterized in terms of the asymptotic behavior of the bump length and height as well as the dependency structure of the process. A major finding is that the asymptotic minimax detection boundary is generically determined by the value of its spectral density at zero. Finally, our asymptotic analysis is complemented by non-asymptotic results for AR($p$) processes and confirmed to serve as a good proxy for finite sample scenarios in a simulation study. Our proofs are based on laws of large numbers for non-independent and non-identically distributed arrays of random variables and the asymptotically sharp analysis of the precision matrix of the process.

Citation

Download Citation

Farida Enikeeva. Axel Munk. Markus Pohlmann. Frank Werner. "Bump detection in the presence of dependency: Does it ease or does it load?." Bernoulli 26 (4) 3280 - 3310, November 2020. https://doi.org/10.3150/20-BEJ1226

Information

Received: 1 June 2019; Revised: 1 April 2020; Published: November 2020
First available in Project Euclid: 27 August 2020

zbMATH: 07256176
MathSciNet: MR4140545
Digital Object Identifier: 10.3150/20-BEJ1226

Rights: Copyright © 2020 Bernoulli Society for Mathematical Statistics and Probability

JOURNAL ARTICLE
31 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.26 • No. 4 • November 2020
Back to Top