A Note on the Run Length to False Alarm of a Change-Point Detection Policy

Research output: Contribution to journalArticlepeer-review

Abstract

A new proof is given to a known result on the average run length to
false alarm of the Shiryayev-Roberts change-point detection policy when
the observations are nonlattice. Via the approach of this new proof, the
average run length to false alarm can be calculated in the lattice case and
for the mixed-type Shiryayev-Roberts scheme.
Original languageAmerican English
Pages (from-to)272-281
Number of pages10
JournalAnnals of Statistics
Volume23
Issue number1
DOIs
StatePublished - 1995

Keywords

  • Change-point detection
  • Control charts
  • Quality control
  • Renewal theory

Fingerprint

Dive into the research topics of 'A Note on the Run Length to False Alarm of a Change-Point Detection Policy'. Together they form a unique fingerprint.

Cite this