Metraipolis › archive › dc_303a3f59005b

On the Sequential Test and Distributed Detection — arXiv:2609.09358

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09358
License (as archived)
CC0-1.0
Archived
2026-10-16T08:47:27.824Z
SHA-256 of the archived text
a1d334571dc108d8baf653b9f75b1f1b7997b9d38a40bde3e5a4a14726ec23e3
Stable URL of this page
https://metraipolis.com/documento/dc_303a3f59005b

How to cite

On the Sequential Test and Distributed Detection — arXiv:2609.09358 — arXiv (en), https://arxiv.org/abs/2609.09358 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_303a3f59005b (Metraipolis archive dc_303a3f59005b, sha256 a1d334571dc108d8baf653b9f75b1f1b7997b9d38a40bde3e5a4a14726ec23e3)
BibTeX
@misc{dc303a3f59005b,
  title = {On the Sequential Test and Distributed Detection — arXiv:2609.09358},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09358},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_303a3f59005b; sha256 a1d334571dc108d8baf653b9f75b1f1b7997b9d38a40bde3e5a4a14726ec23e3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09358. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.ST).
Categorie arXiv: Information Theory (cs.IT) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.09358 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:44:05.097Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).