Department of Mathematics, Virginia Tech, Blacksburg, VA 24061, USA.
Bull Math Biol. 2012 Jan;74(1):175-89. doi: 10.1007/s11538-011-9684-y. Epub 2011 Oct 12.
In this paper, we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I) networks differ from SIS networks in allowing an infected individual to become reinfected without first passing to the susceptible state. We use a covering-graph construction to compare SIR, SIS, and SI(S/I) networks. Like the SIR networks that cover them, SI(S/I) networks exhibit infection probabilities that are monotone with respect to both transmission probabilities and the initial set of infectives. The same covering-graph construction allows us to characterize the recurrent states in an SIS or SI(S/I) network with reinfection.
在本文中，我们介绍了一类新的网络传染病模型，我们称之为 SI(S/I)。与 SIS 网络不同，SI(S/I)网络允许感染个体在不首先进入易感状态的情况下再次感染。我们使用覆盖图构建来比较 SIR、SIS 和 SI(S/I)网络。与覆盖它们的 SIR 网络一样，SI(S/I)网络的感染概率与传播概率和初始感染个体集都呈单调关系。相同的覆盖图构建还允许我们对具有再感染的 SIS 或 SI(S/I)网络中的复发状态进行特征化。
