Analysis of the survival time of the SIRS process via expansion

TL;DR

This paper analyzes the SIRS infection process on graphs, revealing that its survival time can be polynomial or exponential depending on the graph's expansion properties, contrasting with the SIS model.

Contribution

It provides the first rigorous theoretical analysis of the SIRS process's survival time, especially on expander graphs, using expansion properties and Lyapunov functions.

Findings

Expected survival time on stars is at most polynomial in graph size.

On expander graphs with small spectral expansion, survival time is exponential in the number of vertices.

Results imply near-tight thresholds for Erdos-Rényi and hyperbolic random graphs.

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 $\lambda$, 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 $\lambda$. 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 $\lambda \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\'enyi 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.