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

SIRS过程在随机网络中的超临界性

Supercriticality of the SIRS on random networks

Brown University(布朗大学)

Phuc Lam, Oanh Nguyen

AI总结:

研究SIRS过程在不同网络拓扑中持续时间及灭绝速度,发现有限稀疏网络中存在生存时间指数长的区域,幂律网络中生存时间始终指数级,无限树中证明强生存条件,即使在轻尾分布下根节点也被无限次感染。

摘要:

我们研究SIRS过程在不同网络拓扑中持续时间及灭绝速度。我们的结果提供了三种部分特征化:在有限稀疏图中,我们证明存在一个区域,过程在指数时间内持续。在具有幂律似指数的重尾网络中,我们显示对于所有参数范围,生存时间是指数级。最后,在无限树中,我们找到强生存的充分条件,证明即使在轻尾分布如泊松分布下,根节点也被无限次感染。

英文摘要:

We analyze the supercritical regime of the SIRS process (Susceptible-Infected-Recovered-Susceptible) on random graphs and Galton-Watson trees. Our results provide a three-part characterization of this process: first, we prove that even on finite sparse graphs, the epidemic can survive for an exponentially long time. On heavy-tailed networks with power-law-like exponents, we show that this holds for the entire range of parameters. Notably, while contemporary works establish a stretched exponential survival time for power-law networks, our approach provides the optimal bound of order $e^{Θ(n)}$ via a different approach. Finally, for infinite trees, we establish sufficient conditions for strong survival, proving that the root is re-infected infinitely often even for light-tailed degree distributions like the Poisson distribution.

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

↑