在群体监控下重建网络爆发
Reconstructing Network Outbreaks under Group Surveillance
AI总结:
在群体监控下,通过网络传播模型重建疾病传播链,提出NP难问题并设计近似算法。
摘要:
在爆发期间,重建疾病传播链是一个关键的公共卫生问题。这个问题在最大似然估计(MLE)框架下已被广泛研究,该框架将问题转化为在网络中寻找某种Steiner子图。群体监控,如污水或气溶胶监测,是一种大规模/混合检测,其中多个个体的样本被混合在一起并进行一次测试。虽然单个阴性测试可以清除多个个体,但阳性测试不会揭示测试池中的受感染者。我们介绍了POOLCASCADEMLE问题,该问题在网络传播过程中,目标是找到一个与混合测试结果一致的MLE传播子图。以前的研究假设测试结果是针对个体的,即池大小为一,并要求一致的传播链连接阳性测试节点。在POOLCASCADEMLE中,一致的传播链必须在每个阳性池中选择至少一个节点,这增加了另一个组合层。我们证明,在独立传播(IC)模型下,POOLCASCADEMLE是NP难的,并提出了一种基于将其减少到组Steiner树问题的近似算法。我们还考虑了该问题的一个一跳版本,即疾病在被播种后只能传播一次时间步。我们证明,即使这个受限版本也是NP难的,并开发了一种使用线性规划松弛和舍入的方法。我们在真实和合成接触网络上评估了我们的方法的性能,从缺失感染恢复和流行度估计方面。我们发现,我们的方法在与对应于池大小为一和使用最先进的方法的有意义基线相比,表现更优。
英文摘要:
A key public health problem during an outbreak is to reconstruct the disease cascade from a partial set of confirmed infections. This has been studied extensively under the Maximum Likelihood Estimation (MLE) formulation, which reduces the problem to finding some type of Steiner subgraph on a network. Group surveillance like wastewater or aerosol monitoring is a form of mass/pooled testing where samples from multiple individuals are pooled together and tested once for all. While a single negative test clears multiple individuals, a positive test does not reveal the infected individuals in the test pool. We introduce the POOLCASCADEMLE problem in the setting of a network propagation process, where the goal is to find a MLE cascade subgraph which is consistent with the pooled test outcomes. Previous work on reconstruction assumes that the test results are of individuals, i.e., pools of size one, and requires a consistent cascade to connect the positive testing nodes. In POOLCASCADEMLE, a consistent cascade must choose at least one node in each positive pool, adding another combinatorial layer. We show that, under the Independent Cascade (IC) model, POOLCASCADEMLE is NP-hard, and present an approximation algorithm based on a reduction to the Group Steiner Tree problem. We also consider a one-hop version of this problem, in which the disease can spread for one time step after being seeded. We show that even this restricted version is NP-hard, and develop a method using linear programming relaxation and rounding. We evaluate the performance of our methods on real and synthetic contact networks, in terms of missing infection recovery and prevalence estimation. We find that our approach outperforms meaningful baselines which correspond to pools of size one and use state-of-the-art methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。