包容变体的排斥矩阵的渐近速率界限与构造
Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
AI总结:
本文研究了包容变体排斥矩阵的渐近速率界限,提出了一种高效的随机构造并去随机化得到确定性构造,明确了其在群体测试中的渐近潜力。
摘要:
排斥矩阵,也称为覆盖自由族和叠加码,是广泛应用于群体测试的组合数组。其中,满足额外组合性质的变体形成一个特殊的类别,适用于在一般抑制复杂模型下计算高效且高度容错的群体测试,该模型涵盖了实际应用如DNA筛查。尽管这种变体的相关性,包容变体的渐近行为仍鲜有研究。特别是,此前不清楚这种变体是否能实现渐近正速率,这是可扩展群体测试设计的要求。在本工作中,我们建立了包容变体最大可实现速率的首个非平凡渐近下界,该下界与已知最强上界在对数因子范围内一致。我们的证明基于概率方法,得出一个简单且高效的随机构造。此外,我们将此构造去随机化,以获得一个确定性多项式时间构造。这些结果澄清了在一般抑制复杂模型下稳健且可扩展群体测试的渐近潜力。
英文摘要:
Disjunct matrices, also known as cover-free families and superimposed codes, are combinatorial arrays widely used in group testing. Among their variants, those that satisfy an additional combinatorial property called inclusiveness form a special class suitable for computationally efficient and highly error-tolerant group testing under the general inhibitor complex model, a broad framework that subsumes practical settings such as DNA screening. Despite this relevance, the asymptotic behavior of the inclusive variant of disjunct matrices has remained largely unexplored. In particular, it was not previously known whether this variant can achieve an asymptotically positive rate, a requirement for scalable group testing designs. In this work, we establish the first nontrivial asymptotic lower bound on the maximum achievable rate of the inclusive variant, which matches the strongest known upper bound up to a logarithmic factor. Our proof is based on the probabilistic method and yields a simple and efficient randomized construction. Furthermore, we derandomize this construction to obtain a deterministic polynomial-time construction. These results clarify the asymptotic potential of robust and scalable group testing under the general inhibitor complex model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。