随机分组测试的最优两阶段算法
Group Testing with Random Pools: optimal two-stage algorithms
摘要:
本文研究了N个项目的概率群检验问题,每个项目的缺陷概率为p。我们关注的是小缺陷概率p<<1和大变量数N>>1的双重极限,在$N\to\infty$或$p=1/N^β$与$β\in(0,1/2)$之后取p->0。在这两种情况下,通过两阶段程序$\bar T(N,p)$确定缺陷所需的最佳试验次数称为$Np|\log p|$。在这里,我们确定了$\bar T(N,p)/(Np|\log p|)$的尖锐的渐近值,并构造了一个两阶段的算法,在这个最佳值。这是通过为检测的第一阶段选择适当的二分正则图(测试和变量节点)来完成的。此外,我们证明了这个最优值也达到平均在一个随机二分图,所有变量都有相同的程度,而测试泊松分布度。最后,在$p=1/N^β$与$β\in[1/2,1)$的情况下,改进了现有的最优测试次数的上下界.
英文摘要:
We study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p<<1, and large number of variables, N>>1, taking either p->0 after $N\to\infty$ or $p=1/N^β$ with $β\in(0,1/2)$. In both settings the optimal number of tests which are required to identify with certainty the defectives via a two-stage procedure, $\bar T(N,p)$, is known to scale as $Np|\log p|$. Here we determine the sharp asymptotic value of $\bar T(N,p)/(Np|\log p|)$ and construct a class of two-stage algorithms over which this optimal value is attained. This is done by choosing a proper bipartite regular graph (of tests and variable nodes) for the first stage of the detection. Furthermore we prove that this optimal value is also attained on average over a random bipartite graph where all variables have the same degree, while the tests have Poisson-distributed degrees. Finally, we improve the existing upper and lower bound for the optimal number of tests in the case $p=1/N^β$ with $β\in[1/2,1)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。