Suppr超能文献

配置模型网络上传染病方程精确闭包的充要条件。

Necessary and sufficient conditions for exact closures of epidemic equations on configuration model networks.

机构信息

Department of Mathematics, University of Sussex, Falmer, Brighton, BN1 9QH, UK.

Network Science Institute, Northeastern University London, London, E1W 1LP, UK.

出版信息

J Math Biol. 2023 Aug 2;87(2):36. doi: 10.1007/s00285-023-01967-9.

Abstract

We prove that it is possible to obtain the exact closure of SIR pairwise epidemic equations on a configuration model network if and only if the degree distribution follows a Poisson, binomial, or negative binomial distribution. The proof relies on establishing the equivalence, for these specific degree distributions, between the closed pairwise model and a dynamical survival analysis (DSA) model that was previously shown to be exact. Specifically, we demonstrate that the DSA model is equivalent to the well-known edge-based Volz model. Using this result, we also provide reductions of the closed pairwise and Volz models to a single equation that involves only susceptibles. This equation has a useful statistical interpretation in terms of times to infection. We provide some numerical examples to illustrate our results.

摘要

我们证明,如果网络的度分布遵循泊松分布、二项分布或负二项分布,则可以获得 SIR 成对传染病方程的确切封闭解。证明依赖于为这些特定的度分布建立封闭的成对模型与之前证明为精确的动态生存分析(DSA)模型之间的等价性。具体来说,我们证明 DSA 模型等价于著名的基于边缘的 Volz 模型。利用这一结果,我们还将封闭的成对模型和 Volz 模型简化为仅涉及易感染者的单个方程。这个方程在感染时间方面具有有用的统计解释。我们提供了一些数值示例来说明我们的结果。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/cd8a/10397147/d6d77ba4ba66/285_2023_1967_Fig1_HTML.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验