Metraipolis › archive › dc_c3fb1fe05fe2

Pooled Testing under Congestion: Operational Scaling Laws for Pool-Size Selection — arXiv:2610.37729

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.37729
License (as archived)
CC0-1.0
Archived
2026-11-01T02:32:21.326Z
SHA-256 of the archived text
d312cfaa6f736817afc6457e78049a62148d2e35ca3630c2e0123e27d90f616b
Stable URL of this page
https://metraipolis.com/documento/dc_c3fb1fe05fe2

How to cite

Pooled Testing under Congestion: Operational Scaling Laws for Pool-Size Selection — arXiv:2610.37729 — arXiv (en), https://arxiv.org/abs/2610.37729 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c3fb1fe05fe2 (Metraipolis archive dc_c3fb1fe05fe2, sha256 d312cfaa6f736817afc6457e78049a62148d2e35ca3630c2e0123e27d90f616b)
BibTeX
@misc{dcc3fb1fe05fe2,
  title = {Pooled Testing under Congestion: Operational Scaling Laws for Pool-Size Selection — arXiv:2610.37729},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.37729},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c3fb1fe05fe2; sha256 d312cfaa6f736817afc6457e78049a62148d2e35ca3630c2e0123e27d90f616b},
  year = {2026}
}

Archived text

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

Classical pooled-testing rules choose pool sizes to reduce the number of tests. In practice, however, samples arrive over time, pools take time to form, testing capacity is finite, and positive pools create bursts of follow-up work. These operational features can make the test-efficient pool size far from the delay-efficient one. We formulate pooled testing with stochastic arrivals and finite testing capacity as a queueing system, and derive exact performance representations and asymptotic scaling laws for fixed-batch Dorfman testing and a dynamic two-threshold policy. The analysis reveals three distinct design regimes. When test usage is the main concern, the classical Dorfman rule is recovered and the optimal pool size scales with the inverse square root of prevalence. When delay accumulated while the laboratory is busy testing another batch matters, positive pools create service-time variability that grows more rapidly with pool size than the mean retesting burden, and the optimal scale shifts to the inverse cube root of prevalence. When waiting to assemble a pool is itself costly, the optimal fixed pool size remains bounded even as prevalence becomes very small. Under severe capacity scarcity, congestion remains relevant at the classical Dorfman scale: the square-root law survives, but with a capacity-dependent constant. Dynamic pooling separates two operational decisions that fixed pool sizes conflate. A lower threshold determines when routine testing should begin, while an upper threshold limits pooling when backlog is high. The lower threshold follows the cube-root scale, whereas the upper threshold primarily acts as congestion control. The results show how prevalence, capacity, and delay jointly determine pooling decisions and explain why operationally optimal pools can be much smaller than those suggested by test-efficiency calculations alone.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Optimization and Control (math.OC); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.37729 — 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-11-01T02:14:28.335Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).