arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.02653math.PR
收藏

SIRS过程扩展生存时间分析

Analysis of the survival time of the SIRS process via expansion

Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik

摘要:

我们研究了SIRS过程,一个连续时间的马尔可夫链建模的传染病的传播图。在这个模型中,顶点要么是易受感染的,要么是已感染的,要么是已恢复的。每个被感染的顶点以速率1恢复,并以速率$λ$独立地感染其每个易感邻居,每个恢复的顶点以速率$\varrho$变得易感,我们假设该速率与图的大小无关。SIRS过程的中心量是直到没有顶点被感染的时间,称为存活时间。令人惊讶的是,严格的理论结果只存在于相关的SIS模型到目前为止。我们通过对SIRS过程的膨胀特性进行理论分析来解决这种不平衡。我们证明了SIRS过程在恒星上的期望生存时间是至多多项式在图的大小为任何值的$λ$。这种行为与SIS过程有着根本的不同,SIS过程中,对于小的感染率,预期的存活时间已经是指数级的。我们的主要结果是膨胀图上的SIRS过程的预期生存时间的指数下界。具体而言,我们表明,在扩展图$G$与$n$顶点,度接近$d$,和足够小的频谱扩展,SIRS过程具有预期的生存时间至少在$n$指数时,$λ\geq c/d$为常数$c > 1$。SIS过程的先前结果表明,这个界限几乎是紧的。另外,即使$G$是子图,我们的结果也成立.值得注意的是,我们的结果意味着一个几乎紧阈值的Erdos-Rényi图和制度的指数生存时间的双曲随机图。我们的主要结果的证明借鉴了平均场理论中的李雅普诺夫函数,设计了一个二维的势函数,并应用负漂移定理证明了期望的生存时间是指数的。

英文摘要:

We study the SIRS process, a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each infected vertex becomes recovered at rate 1 and infects each of its susceptible neighbors independently at rate $λ$, and each recovered vertex becomes susceptible at a rate $\varrho$, which we assume to be independent of the graph size. A central quantity of the SIRS process is the time until no vertex is infected, known as the survival time. Surprisingly though, rigorous theoretical results exist only for the related SIS model so far. We address this imbalance by conducting theoretical analyses of the SIRS process via their expansion properties. We prove that the expected survival time of the SIRS process on stars is at most polynomial in the graph size for any value of $λ$. This behavior is fundamentally different from the SIS process, where the expected survival time is exponential already for small infection rates. Our main result is an exponential lower bound of the expected survival time of the SIRS process on expander graphs. Specifically, we show that on expander graphs $G$ with $n$ vertices, degree close to $d$, and sufficiently small spectral expansion, the SIRS process has expected survival time at least exponential in $n$ when $λ\geq c/d$ for a constant $c > 1$. Previous results on the SIS process show that this bound is almost tight. Additionally, our result holds even if $G$ is a subgraph. Notably, our result implies an almost-tight threshold for Erdos-Rényi graphs and a regime of exponential survival time for hyperbolic random graphs. The proof of our main result draws inspiration from Lyapunov functions used in mean-field theory to devise a two-dimensional potential function and applying a negative-drift theorem to show that the expected survival time is exponential.

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

↑