Search arXivSearch

arXiv · 2604.24684

Waning Immunity Fails to Restore a Positive Epidemic Threshold on Power-Law Networks

Abstract

In a seminal work, Chatterjee and Durrett (2009) established that for the SIS epidemic process on random graphs with power-law degree distributions, the infection survives for an exponentially long time (in the network size) for any fixed, positive infection rate. Equivalently, the critical infection rate separating polynomial and exponential survival regimes is zero. In contrast, a substantial body of work in the physics literature conjectures, based primarily on numerical evidence and heuristic mean-field arguments, that introducing waning immunity (as in the SIRS process) yields a strictly positive critical infection rate on random graphs with power-law degrees; see, e.g., Pastor-Satorras et al. (2015), Ferreira et al. (2016), Silva et al. (2022). In particular, below this threshold, the epidemic is expected to persist only for a polynomial duration. A recent work by Friedrich et al. (2024) reinforces this perspective by proving polynomial survival for the SIRS process on star graphs, which is in contrast to the exponential survival in the SIS case that underpins Chatterjee and Durrett's arguments. In this paper, we disprove this conjecture and show that the epidemic threshold is also zero for the SIRS process on the configuration model with power-law degree distribution with exponent $τ>2$. Our proof uncovers a novel bottleneck structure for the SIRS dynamics, which we term a "hierarchical star" of order 2, and show that it sustains the infection for an exponentially long time with high probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zihao He, Souvik Dhara, Debankur Mukherjee. 2026-04-27. Waning Immunity Fails to Restore a Positive Epidemic Threshold on Power-Law Networks. https://arxiv.org/abs/2604.24684

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR