Abstract
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 ϱ, 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, to the best of our knowledge, all known rigorous theoretical results that exist so far immediately carry over from the related SIS model and do not completely explain the behavior of the SIRS process. We address this imbalance by conducting theoretical analyses of the SIRS process via the expansion properties of the underlying graph.
Our first result shows 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. This raises the question of which graph properties result in an exponential survival time. 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 for a constant . 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 Erdős–Rényi graphsand a regime of exponential survival time for complex network models. The proof of our main result draws inspiration from Lyapunov functions used in mean-field theory to devise a two-dimensional potential function and from applying a negative-drift theorem to show that the expected survival time is exponential.
Acknowledgments
We would like to thank Silvio Ferreira for bringing [14] to our attention and for insightful comments that helped us improve the expected survival time of Theorem 1.1.
Andreas Göbel was funded by the project PAGES (project No. 467516565) of the German Research Foundation (DFG). Marcus Pappik was funded by the HPI Research School on Data Science and Engineering.
Citation
Tobias Friedrich. Andreas Göbel. Nicolas Klodt. Martin S. Krejca. Marcus Pappik. "Analysis of the survival time of the SIRS process via expansion." Electron. J. Probab. 29 1 - 29, 2024. https://doi.org/10.1214/24-EJP1140
Information