Asymptotically optimal pointwise and minimax quickest change-point detection for dependent data

Serguei Pergamenchtchikov () and Alexander G. Tartakovsky ()
Additional contact information
Serguei Pergamenchtchikov: LMRS, CNRS - University of Rouen
Alexander G. Tartakovsky: AGT StatConsult

Statistical Inference for Stochastic Processes, 2018, vol. 21, issue 1, No 9, 217-259

Abstract: Abstract We consider the quickest change-point detection problem in pointwise and minimax settings for general dependent data models. Two new classes of sequential detection procedures associated with the maximal “local” probability of a false alarm within a period of some fixed length are introduced. For these classes of detection procedures, we consider two popular risks: the expected positive part of the delay to detection and the conditional delay to detection. Under very general conditions for the observations, we show that the popular Shiryaev–Roberts procedure is asymptotically optimal, as the local probability of false alarm goes to zero, with respect to both these risks pointwise (uniformly for every possible point of change) and in the minimax sense (with respect to maximal over point of change expected detection delays). The conditions are formulated in terms of the rate of convergence in the strong law of large numbers for the log-likelihood ratios between the “change” and “no-change” hypotheses, specifically as a uniform complete convergence of the normalized log-likelihood ratio to a positive and finite number. We also develop tools and a set of sufficient conditions for verification of the uniform complete convergence for a large class of Markov processes. These tools are based on concentration inequalities for functions of Markov processes and the Meyn–Tweedie geometric ergodic theory. Finally, we check these sufficient conditions for a number of challenging examples (time series) frequently arising in applications, such as autoregression, autoregressive GARCH, etc.

Keywords: Asymptotic optimality; Change-point detection; Shiryaev–Roberts procedure; Sequential detection (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s11203-016-9149-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sistpr:v:21:y:2018:i:1:d:10.1007_s11203-016-9149-x

Ordering information: This journal article can be ordered from
http://www.springer. ... ty/journal/11203/PS2

DOI: 10.1007/s11203-016-9149-x

Access Statistics for this article

Statistical Inference for Stochastic Processes is currently edited by Denis Bosq, Yury A. Kutoyants and Marc Hallin

More articles in Statistical Inference for Stochastic Processes from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().