Quickest Change Detection of a Markov Process Across a Sensor Array

DOI10.1109/TIT.2010.2040869zbMath1366.94152arXiv0812.3742MaRDI QIDQ5281549

Vasanthan Raghavan, Venugopal V. Veeravalli

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.3742

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Markov and semi-Markov decision processes (90C40) Markov processes: hypothesis testing (62M02)

Related Items

Sequential Sensor Installation for Wiener Disorder Detection, Asymptotically Pointwise Optimal Change Detection in Multiple Channels, Robustness of the \(N\)-CUSUM stopping rule in a Wiener disorder problem, Sequential algorithms for moving anomaly detection in networks, Decision and game theory for security. Second international conference, GameSec 2011, College Park, MD, Maryland, USA, November 14--15, 2011. Proceedings, Are there needles in a moving haystack? Adaptive sensing for detection of dynamically evolving signals, Bayesian Quickest Detection in Sensor Arrays, Streaming changepoint detection for transition matrices