This work considers the problem of quickest detection of signals in a coupled system of N sensors, which receive continuous sequential observations from the environment. It is assumed that the signals, which are modeled by general Itô processes, are coupled across sensors, but that their onset times may differ from sensor to sensor. Two main cases are considered; in the first one signal strengt...

The Byzantine distributed quickest change detection (BDQCD) is studied, where a fusion center monitors the occurrence of an abrupt event through bunch sensors that may be compromised. We first consider binary hypothesis case there only one post-change and prove novel converse to first-order asymptotic delay in large mean time false alarm regime. This tight it coincides with currently best achie...

The problem of quickly diagnosing an unknown change in a stochastic process is studied. We establish novel bounds on the performance misspecified diagnosis algorithms designed for changes that differ from those process, and pose solve new robust quickest asymptotic regime few false alarms isolations. Simulations suggest our asymptotically solution offers computationally efficient alternative to...