PreprintCC BY 4.0arXiv
On the Sequential Test and Distributed Detection
Abstract
We present a simple definition of stopping time and its role in the formulation of sequential tests for both centralized and distributed detection, providing a straightforward procedure for obtaining optimal decision rules. Upper bounds for optimal stopping time are derived and numerically shown to possess certain qualitative features expected of the optimal stopping time. The results are extended to any distributed detection network in the form of an acyclic directed graph.
Related
- Sequential generalized kernel equating: Providing comparable scores across multiple test forms with nonequivalent groups and differently measured covariates
- Sequential Probability Ratio Test using Z-Statistics (SPRT-z): A Practical Approach for Online Experimentation
- Bitcoin UTXO Values Are Heavy-Tailed but not Power-Law Distributed: A Clauset-Shalizi-Newman Test across Eight Snapshots
- Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection
- Truncated sequential change-point detection for Markov chains with applications in the epidemic statistical analysis
BibTeX
@misc{akofor2026sequential,
title = {{On the Sequential Test and Distributed Detection}},
author = {Earnest Akofor},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.09358},
eprint = {2609.09358},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.09358},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the Sequential Test and Distributed Detection
AU - Earnest Akofor
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.09358
UR - https://arxiv.org/abs/2609.09358
AB - We present a simple definition of stopping time and its role in the formulation of sequential tests for both centralized and distributed detection, providing a straightforward procedure for obtaining optimal decision rules. Upper bounds for optimal stopping time are derived and numerically shown to possess certain qualitative features expected of the optimal stopping time. The results are extended to any distributed detection network in the form of an acyclic directed graph.
ER -