在时序接触网络中寻找零号病人:一项比较研究
Finding Patient Zero in Temporal Contact Networks: A Comparative Study
Nathan Cincera Brack, Martin Sterchi, Lorenz Hilfiker, Abraham Bernstein
AI 速读 基于摘要
该研究在同一问题表述下系统比较七种时序接触网络传染源推断方法,发现BP与BN整体最强,IBA、DMP、MCMF因因子化似然假设而过度自信。
cs.SI
查看原文摘要
Identifying the source of an epidemic, i.e., the patient zero, in a temporal contact network is important for effective outbreak containment and resource allocation. While several methods have been proposed for this task, they have rarely been evaluated under comparable conditions, and no systematic comparison exists for temporal contact networks. We address this gap with a comparative study of seven major methods, namely Steiner Tree (ST), Individual-Based Approximation (IBA), Dynamic Message Passing (DMP), Monte Carlo Mean-Field (MCMF), Soft Margin Estimator (SME), Backtracking Network (BN, a graph neural network), and Belief Propagation (BP). We unify all methods under a single problem formulation and evaluate them on eight diverse temporal networks. In the main experiment, we compare source detection performance for varying basic reproduction numbers. Three complementary experiments on a subset of networks study (i) learning curves, (ii) partial observability, and (iii) parameter misspecification. We find that BP and BN are the strongest source detectors overall. SME is strong under partial observation but mediocre otherwise. IBA, DMP, and MCMF share a common weakness rooted in their factorized-likelihood assumption, leading to overconfident predictions. We identify scaling these methods to larger networks as the most pressing direction for future work.