Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 839

The DOI matches its Crossref record.

On Optimum Methods in Quickest Detection Problems

Shiryaev, A. N.·1963·Theory of Probability & Its Applications

Abstract

In this paper optimum methods are developed for observing a process (1), in which the moment when a “disorder” $\theta$ appears is not known. The basic quantity characterizing the quality of this observation method is the mean time delay ${\boldsymbol \tau}$ for detection of a disorder. After making assumption (4) it is shown that for a given false alarm probability $\omega$ or for a given ${\bf N}$ — mathematical expectation of false alarm numbers occurring up to the moment the disorder appears — the observation method minimizing ${\boldsymbol \tau } = {\boldsymbol \tau } (\omega)$ or ${\boldsymbol \tau} = {\boldsymbol \tau} ({\boldsymbol N})$ is based on an observation of a posteriors probability (23). In § 3 a case is considered, wherein, the disorder appears on the background of steadystate conditions arising when the disorder is absent. A method is found for minimizing ${\boldsymbol \tau} = {\boldsymbol \tau} ({\bf T})$ for a set ${\bf T}$ — mathematical expectation of the time between two false alarms. The dependence ${\boldsymbol \tau} = {\boldsymbol \tau} ({\bf T})$ is given by formula (36).

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/1108002

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 839

Metadata

Authors
Shiryaev, A. N.
Venue
Theory of Probability & Its Applications
Published
1963-01
Volume
8
Issue
1
Pages
22-46
ISSN
  • 0040-585X (ISSN-L)
  • 1095-7219
OpenAlex
W2004094275
Cited by
839
References
0
FWCI
10.37
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On Optimum Methods in Quickest Detection Problems. https://app.cochat.ai/papers/10.1137/1108002
The paper
Shiryaev, A. N. (1963). On Optimum Methods in Quickest Detection Problems. Theory of Probability & Its Applications. https://doi.org/10.1137/1108002

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.