Epidemic thresholds of infectious diseases on tie-decay networks

Qinyi Chen, Mason A. Porter

TL;DR

This paper introduces a mathematical framework for calculating epidemic thresholds on "tie-decay networks"—models where social ties strengthen during interactions and fade exponentially over time. By moving beyond traditional "on/off" network snapshots, the authors provide a more realistic way to predict whether a disease will fizzle out or explode into a large-scale outbreak in continuous-time systems.

What Problem Does This Paper Address?

In network epidemiology, the epidemic threshold is the "tipping point": if the disease's spreading power exceeds this value, it becomes an epidemic; otherwise, it dies out.

Most existing models treat networks as a series of static "snapshots" (discrete-time). However, real-world social interactions are continuous and nuanced. A conversation today might leave a "trace" of risk that lingers but fades until the next meeting. Traditional models often ignore this "decay" or force researchers to choose arbitrary time windows (e.g., binning all contacts into 1-hour blocks), which can lead to inaccurate forecasts. The authors address the challenge of calculating the epidemic threshold in a system where the network structure itself is constantly and smoothly evolving.

Methods

The authors utilize tie-decay networks, where the strength of a connection between two people is governed by an ordinary differential equation (ODE). When people interact, the tie strength jumps; between interactions, it decays exponentially at a rate $\alpha$.

To find the threshold for a Susceptible-Infected-Susceptible (SIS) model, they employ two distinct mathematical paths:

  1. Linear Stability Analysis: They model the infection probability as a nonlinear dynamical system and determine the conditions under which the "disease-free" state becomes unstable.
  2. Multilayer Tensor Representation: They represent the temporal network as a multilayer structure and calculate the spectral radius (the largest eigenvalue) of a "system matrix" $\mathbf{S}$.

Crucially, they demonstrate that even though the math assumes a periodic network for stability, the threshold can be accurately estimated using only a small fraction of early-stage data.

Datasets

The study validates its theoretical findings using both synthetic and empirical data:

  • Synthetic: Erdős–Rényi (ER) random networks were used to systematically test how network sparsity and interaction frequency affect the threshold.
  • Workplace Network: Data from an office building in France (2013), capturing interactions between 93 individuals over several days.
  • Conference Network: Face-to-face contact data from the ACM Hypertext 2009 conference, involving 113 attendees.

Key Insights and Ideas

  • The "Memory" of a Tie: Unlike traditional temporal networks that treat every time step as a clean slate, tie-decay networks capture the "long-lasting influence" of past interactions. This is vital for modeling diseases that might spread via contaminated surfaces or lingering aerosols.
  • Fast Convergence: One of the most practical "aha" moments is that the epidemic threshold estimate stabilizes very quickly. You don't need a year of data to predict a multi-year epidemic; the first few days of interaction patterns are often enough to characterize the system's spreading potential.
  • The Binning Bias: The paper shows that traditional "binning" (grouping interactions into fixed time windows) tends to push the critical values very close to 1, making it difficult to distinguish between different spreading regimes. Tie-decay models provide a much clearer "signal" for researchers.
  • Parameter Sensitivity: The authors quantify how the decay rate ($\alpha$), interaction frequency ($\beta$), and network sparsity ($p$) interact. For instance, increasing the decay rate (making ties fade faster) is mathematically equivalent to raising the threshold, making it harder for a disease to spread.

Key Results

  • Theoretical Validation: Numerical simulations perfectly matched the derived threshold condition ($\rho_{cr}(\mathbf{S}) = 1$). When the calculated value was below 1, the disease died out; above 1, it persisted.
  • Correlation with Outbreak Size: There is a strong positive Pearson correlation (often $>0.8$) between the calculated threshold value and the final size of the outbreak, suggesting the threshold is a reliable proxy for disease severity.
  • Predictive Power: In real-world datasets, the authors successfully estimated the threshold using only about 1/10th of the total time span, proving the model's utility for early-warning systems.

Limitations and Future Work

  • Periodic Assumptions: The mathematical derivation relies on a "periodic boundary condition" (assuming the network pattern eventually repeats). While shown to be less of an issue in practice, it remains a theoretical constraint.
  • Model Complexity: This study focused on the SIS model. Future work is needed to extend these derivations to more complex models like SIR (Recovered) or SEIR (Exposed), which are more common for diseases like COVID-19 or influenza.
  • Burstiness: The current model uses exponential waiting times for interactions. Real human behavior is often "bursty" (long periods of inactivity followed by flurries of contact). Integrating "Hawkes processes" into the tie-decay framework is a suggested next step to capture this burstiness.

Summary updated

Abstract

In the study of infectious diseases on networks, researchers calculate epidemic thresholds to help forecast whether a disease will eventually infect a large fraction of a population. Because network structure typically changes in time, which fundamentally influences the dynamics of spreading processes on them and in turn affects epidemic thresholds for disease propagation, it is important to examine epidemic thresholds in temporal networks. Most existing studies of epidemic thresholds in temporal networks have focused on models in discrete time, but most real-world networked systems evolve continuously in time. In our work, we encode the continuous time-dependence of networks into the evaluation of the epidemic threshold of a susceptible--infected--susceptible (SIS) process by studying an SIS model on tie-decay networks. We derive the epidemic-threshold condition of this model, and we perform numerical experiments to verify it. We also examine how different factors---the decay coefficients of the tie strengths in a network, the frequency of interactions between nodes, and the sparsity of the underlying social network in which interactions occur---lead to decreases or increases of the critical values of the threshold and hence contribute to facilitating or impeding the spread of a disease. We thereby demonstrate how the features of tie-decay networks alter the outcome of disease spread.
BibTeX
@article{chen2021epidemic,
  author = {Qinyi Chen and Mason A. Porter},
  title = {{Epidemic thresholds of infectious diseases on tie-decay networks}},
  journal = {J. Complex Networks},
  year = {2021},
  doi = {10.1093/comnet/cnab031},
}
Figure