Minimal percolating sets for mutating infectious diseases
Minimal percolating sets for mutating infectious diseases
复制标题
DOI：
10.1103/physrevresearch.2.023001
复制
发表时间：
2020-04-01
影响因子：
4.2
通讯作者：
Schaposnik LP
中科院分区：
文献类型：
--
作者：
Luo Y;Schaposnik LP
本文致力于研究动态系统与渗透模型之间的相互作用，以期研究病毒随时间突变的病毒感染。回想一下，-bootstrap渗透描述了一个确定性过程，当图的邻居被感染时，图的顶点就会被感染。我们通过引入自举渗透（-bootstrap percolation）来推广这一点，这是一个时间相关的过程，其中需要感染的相邻顶点的数量才能传播疾病，这是由每次的渗透函数决定的。在研究了模型的一些基本性质之后，我们考虑了最小渗透集，并构造了一个多项式时间算法，用于在有限树上寻找一个最小的最小渗透集。
This paper is dedicated to the study of the interaction between dynamical systems and percolation models, with views toward the study of viral infections whose virus mutate with time. Recall that -bootstrap percolation describes a deterministic process where vertices of a graph are infected once neighbors of it are infected. We generalize this by introducing -bootstrap percolation, a time-dependent process where the number of neighboring vertices that need to be infected for a disease to be transmitted is determined by a percolation function at each time . After studying some of the basic properties of the model, we consider smallest percolating sets and construct a polynomial-timed algorithm to find one smallest minimal percolating set on finite trees for certain -bootstrap percolation models.