跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+58新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 00:01 — 2026-11-19 00:01(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2610.37729

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

Ioannis Dimitriou, Johan van Leeuwaarden

原文摘要

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.

cs.IT · math.OC · math.PR