The Optimal Stopping Time for Detecting Changes in Discrete Time Markov Processes
From MaRDI portal
Publication:3618558
DOI10.1080/07474940802619451zbMath1165.62054OpenAlexW2086444207MaRDI QIDQ3618558
Publication date: 2 April 2009
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474940802619451
Applications of statistics in engineering and industry; control charts (62P30) Sequential statistical analysis (62L10) Optimal stopping in statistics (62L15)
Related Items
A Note on “The Optimal Stopping Time for Detecting Changes in Discrete Time Markov Processes” by Han and Tsung, Author's Response, Change-Point Problem for High-Order Markov Chain, Malware Family Discovery Using Reversible Jump MCMC Sampling of Regimes, Change-Point Detection in Binomial Thinning Processes, with Applications in Epidemiology, CHARACTERIZATIONS OF OPTIMAL POLICIES IN A GENERAL STOPPING PROBLEM AND STABILITY ESTIMATING
Cites Work
- Unnamed Item
- Markov chains and stochastic stability
- Decision theoretic optimality of the cusum procedure
- Optimal detection of a change in distribution
- Optimal stopping times for detecting changes in distributions
- An algorithm for detecting a change in a stochastic process
- Information bounds and quick detection of parameter changes in stochastic systems
- Procedures for Reacting to a Change in Distribution