Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A lower bound on the ARL to detection of a change with a probability constraint on false alarm

From MaRDI portal
Publication:1922416
Jump to:navigation, search

DOI10.1214/aos/1033066219zbMath0853.62063OpenAlexW2087561340MaRDI QIDQ1922416

Benjamin Yakir

Publication date: 7 January 1997

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1033066219


zbMATH Keywords

inequalitychange-point detectionprobability of false alarmaverage run length to detectionlower bound on the rate of detection


Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Sequential statistical analysis (62L10)


Related Items

Discord Detection For A Process With A Predefined Interval Of Observations ⋮ Detecting a change in regression: First-order optimality



Cites Work

  • Random difference equations and renewal theory for products of random matrices
  • Approximations to the expected sample size of certain sequential tests
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1922416&oldid=14350501"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki