arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.00102q-bio.PEcs.SI
收藏

d-团图上的传染病模型

Modeling epidemics on d-cliqued graphs

Laura P. Schaposnik, Anlin Zhang

摘要:

由于社会相互作用已被证明会导致对称集群,我们在这里提出对称性在流行病建模中起着关键作用。最近,d元树图上的数学模型被证明对简单网络中的流行病建模特别有效[Seibold & Callender,2016]。为了解释对称关系,我们将其推广到一种新型的网络模型上的d-团树图,这是通过添加边缘到正规的d-树,形成d-团。这一背景为流行病暴发提供了一个更现实的模型,例如起源于家庭或教室,并可通过学校儿童传播到人口中。具体来说,我们量化了从一个集团(例如家庭)开始的感染如何通过图的主体(例如公共场所)到达其他集团。此外,我们提出并研究了安全区的概念,即感染概率可以忽略不计的子集。

英文摘要:

Since social interactions have been shown to lead to symmetric clusters, we propose here that symmetries play a key role in epidemic modeling. Mathematical models on d-ary tree graphs were recently shown to be particularly effective for modeling epidemics in simple networks [Seibold & Callender, 2016]. To account for symmetric relations, we generalize this to a new type of networks modeled on d-cliqued tree graphs, which are obtained by adding edges to regular d-trees to form d-cliques. This setting gives a more realistic model for epidemic outbreaks originating, for example, within a family or classroom and which could reach a population by transmission via children in schools. Specifically, we quantify how an infection starting in a clique (e.g. family) can reach other cliques through the body of the graph (e.g. public places). Moreover, we propose and study the notion of a safe zone, a subset that has a negligible probability of infection.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑