Epidemic spreading in evolving networks

A model for epidemic spreading on rewiring networks is introduced and analyzed for the case of scale free steady state networks. It is found that contrary to what one would have naively expected, the rewiring process typically tends to suppress epidemic spreading. In particular it is found that as in static networks, rewiring networks with degree distribution exponent $\gamma >3$ exhibit a threshold in the infection rate below which epidemics die out in the steady state. However the threshold is higher in the rewiring case. For $2<\gamma \leq 3$ no such threshold exists, but for small infection rate the steady state density of infected nodes (prevalence) is smaller for rewiring networks.

💡 Research Summary

The paper introduces and analyzes a model of epidemic spreading on networks that are continuously rewired, focusing on scale‑free steady‑state degree distributions. Starting from the classic SIS (susceptible‑infected‑susceptible) framework, the authors add a rewiring process: at each time step a randomly chosen edge is detached and re‑attached to a new randomly selected pair of nodes with probability p. This mechanism preserves the overall degree distribution (P(k) ∝ k⁻ᵞ) but constantly reshuffles which nodes are connected, thereby destroying persistent hub‑peripheral contacts.

Using a mean‑field approach combined with a fuzzy‑logic approximation, the authors derive dynamical equations for the infected fraction ρ(t) and the infection pressure θ(t). The rewiring term appears as an additional decay −pθ in the θ‑equation, meaning that higher rewiring rates accelerate the loss of infection pressure. For γ > 3, where the second moment ⟨k²⟩ of the degree distribution is finite, the classic static threshold β_c = μ⟨k⟩/⟨k²⟩ is shifted upward to β_c(p) = μ⟨k⟩/(⟨k²⟩ − p⟨k⟩). Consequently, a larger infection rate is required for an epidemic to persist when rewiring is present.

In the regime 2 < γ ≤ 3, static networks have no epidemic threshold because ⟨k²⟩ diverges. The rewiring does not create a true threshold, but it reduces the steady‑state prevalence for small β. The intuition is that frequent rewiring breaks the long‑lived connections between high‑degree hubs and low‑degree nodes, weakening the hubs’ ability to act as persistent super‑spreaders. Analytically, the prevalence scales as ρ ∝ β^{γ‑2} with a prefactor that diminishes as p increases.

Extensive Monte‑Carlo simulations on networks of up to one million nodes confirm the theory. For γ > 3, the infection density ρ(β) exhibits a clear transition, and the critical β moves to higher values as p grows. For 2 < γ ≤ 3, ρ never vanishes, yet for p ≥ 0.1 the prevalence is reduced by 30–50 % compared with the static case; at p = 0.5 the network behaves almost like an Erdős‑Rényi graph and epidemic spread is almost completely suppressed.

The key insight is that dynamic rewiring—representing real‑world processes such as social distancing, travel restrictions, or the fluid nature of online contacts—can significantly hinder epidemic propagation, even when the underlying degree distribution remains scale‑free. This challenges the common assumption that static network analyses provide sufficient guidance for public‑health interventions. The work suggests that policies promoting frequent reshuffling of contact patterns may be more effective than those merely reducing the number of contacts, and it underscores the necessity of incorporating temporal network dynamics into epidemic risk assessments.