Source identification via contact tracing in the presence of asymptomatic patients.

IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS
Applied Network Science Pub Date : 2023-01-01 Epub Date: 2023-08-21 DOI:10.1007/s41109-023-00566-3
Gergely Ódor, Jana Vuckovic, Miguel-Angel Sanchez Ndoye, Patrick Thiran
{"title":"Source identification via contact tracing in the presence of asymptomatic patients.","authors":"Gergely Ódor, Jana Vuckovic, Miguel-Angel Sanchez Ndoye, Patrick Thiran","doi":"10.1007/s41109-023-00566-3","DOIUrl":null,"url":null,"abstract":"<p><p>Inferring the source of a diffusion in a large network of agents is a difficult but feasible task, if a few agents act as sensors revealing the time at which they got hit by the diffusion. One of the main limitations of current source identification algorithms is that they assume full knowledge of the contact network, which is rarely the case, especially for epidemics, where the source is called patient zero. Inspired by recent implementations of contact tracing algorithms, we propose a new framework, which we call Source Identification via Contact Tracing Framework (SICTF). In the SICTF, the source identification task starts at the time of the first hospitalization, and initially we have no knowledge about the contact network other than the identity of the first hospitalized agent. We may then explore the network by contact queries, and obtain symptom onset times by test queries in an adaptive way, i.e., both contact and test queries can depend on the outcome of previous queries. We also assume that some of the agents may be asymptomatic, and therefore cannot reveal their symptom onset time. Our goal is to find patient zero with as few contact and test queries as possible. We implement two local search algorithms for the SICTF: the LS algorithm, which has recently been proposed by Waniek et al. in a similar framework, is more data-efficient, but can fail to find the true source if many asymptomatic agents are present, whereas the LS+ algorithm is more robust to asymptomatic agents. By simulations we show that both LS and LS+ outperform previously proposed adaptive and non-adaptive source identification algorithms adapted to the SICTF, even though these baseline algorithms have full access to the contact network. Extending the theory of random exponential trees, we analytically approximate the source identification probability of the LS/ LS+ algorithms, and we show that our analytic results match the simulations. Finally, we benchmark our algorithms on the Data-driven COVID-19 Simulator (DCS) developed by Lorch et al., which is the first time source identification algorithms are tested on such a complex dataset.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10442312/pdf/","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Network Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41109-023-00566-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/8/21 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

Abstract

Inferring the source of a diffusion in a large network of agents is a difficult but feasible task, if a few agents act as sensors revealing the time at which they got hit by the diffusion. One of the main limitations of current source identification algorithms is that they assume full knowledge of the contact network, which is rarely the case, especially for epidemics, where the source is called patient zero. Inspired by recent implementations of contact tracing algorithms, we propose a new framework, which we call Source Identification via Contact Tracing Framework (SICTF). In the SICTF, the source identification task starts at the time of the first hospitalization, and initially we have no knowledge about the contact network other than the identity of the first hospitalized agent. We may then explore the network by contact queries, and obtain symptom onset times by test queries in an adaptive way, i.e., both contact and test queries can depend on the outcome of previous queries. We also assume that some of the agents may be asymptomatic, and therefore cannot reveal their symptom onset time. Our goal is to find patient zero with as few contact and test queries as possible. We implement two local search algorithms for the SICTF: the LS algorithm, which has recently been proposed by Waniek et al. in a similar framework, is more data-efficient, but can fail to find the true source if many asymptomatic agents are present, whereas the LS+ algorithm is more robust to asymptomatic agents. By simulations we show that both LS and LS+ outperform previously proposed adaptive and non-adaptive source identification algorithms adapted to the SICTF, even though these baseline algorithms have full access to the contact network. Extending the theory of random exponential trees, we analytically approximate the source identification probability of the LS/ LS+ algorithms, and we show that our analytic results match the simulations. Finally, we benchmark our algorithms on the Data-driven COVID-19 Simulator (DCS) developed by Lorch et al., which is the first time source identification algorithms are tested on such a complex dataset.

Abstract Image

Abstract Image

Abstract Image

在无症状患者存在的情况下通过接触者追踪进行源头识别。
如果几个代理充当传感器,揭示他们被扩散击中的时间,那么在大型代理网络中推断扩散的来源是一项困难但可行的任务。目前的源头识别算法的主要局限性之一是,它们假设对接触网络有充分的了解,而这种情况很少发生,尤其是对于流行病,源头被称为零号病人。受最近接触追踪算法实现的启发,我们提出了一个新的框架,我们称之为通过接触追踪框架进行源识别(SICTF)。在SICTF中,源识别任务从第一次住院时开始,最初我们除了第一个住院代理人的身份之外,对联系网络一无所知。然后,我们可以通过接触查询来探索网络,并以自适应的方式通过测试查询来获得症状发作时间,即接触和测试查询都可以取决于先前查询的结果。我们还假设一些药剂可能没有症状,因此无法透露其症状发作时间。我们的目标是通过尽可能少的联系和测试查询找到零号患者。我们为SICTF实现了两种局部搜索算法:最近由Waniek等人提出的LS算法。在类似的框架中,它更具数据效率,但如果存在许多无症状代理,则可能无法找到真正的源,而LS+算法对无症状代理更具鲁棒性。通过仿真,我们表明LS和LS+都优于先前提出的适用于SICTF的自适应和非自适应源识别算法,即使这些基线算法可以完全访问接触网络。在扩展随机指数树理论的基础上,我们对LS/LS+算法的源识别概率进行了解析近似,并表明我们的解析结果与仿真结果相匹配。最后,我们在Lorch等人开发的数据驱动新冠肺炎模拟器(DCS)上对我们的算法进行了基准测试,这是首次在如此复杂的数据集上测试源识别算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Network Science
Applied Network Science Multidisciplinary-Multidisciplinary
CiteScore
4.60
自引率
4.50%
发文量
74
审稿时长
5 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信