Spectral properties and the accuracy of mean-field approaches for epidemics on correlated power-law networks

Susceptible-infected-susceptible process on Erdős-Rényi graphs: Determining the infected fraction

There are many methods to estimate the quasistationary infected fraction of the SIS process on (random) graphs. A challenge is to adequately incorporate correlations, which is especially important in sparse graphs. Methods typically are either significantly biased in sparse graphs, or computationally very demanding already for small network sizes. The former applies to heterogeneous mean field and to the N-intertwined mean field approximation, the latter to most higher order approximations. In this paper we introduce a method to determine the infected fraction in sparse graphs, which we test on Erdős-Rényi graphs. Our method is based on degree pairs, does take into account correlations, and gives accurate estimates. At the same time, computations are very feasible and can easily be done even for large networks.

Weighted-ensemble network simulations of the susceptible-infected-susceptible model of epidemics

The presence of erratic or unstable paths in standard kinetic Monte Carlo simulations significantly undermines the accurate simulation and sampling of transition pathways. While typically reliable methods, such as the Gillespie algorithm, are employed to simulate such paths, they encounter challenges in efficiently identifying rare events due to their sequential nature and reliance on exact Monte Carlo sampling. In contrast, the weighted-ensemble method effectively samples rare events and accelerates the exploration of complex reaction pathways by distributing computational resources among multiple replicas, where each replica is assigned a weight reflecting its importance, and evolves independently from the others. Here, we implement the highly efficient and robust weighted-ensemble method to model susceptible-infected-susceptible dynamics on large heterogeneous population networks, and explore the interplay between stochasticity and contact heterogeneity, which ultimately gives rise to disease clearance. Studying a wide variety of networks characterized by fat-tailed asymmetric degree distributions, we are able to compute the mean time to extinction and quasistationary distribution around it in previously inaccessible parameter regimes.

Accuracy of discrete- and continuous-time mean-field theories for epidemic processes on complex networks

Discrete- and continuous-time approaches are frequently used to model the role of heterogeneity on dynamical interacting agents on the top of complex networks. While, on the one hand, one does not expect drastic differences between these approaches, and the choice is usually based on one's expertise or methodological convenience, on the other hand, a detailed analysis of the differences is necessary to guide the proper choice of one or another approach. We tackle this problem by investigating both discrete- and continuous-time mean-field theories for the susceptible-infected-susceptible (SIS) epidemic model on random networks with power-law degree distributions. We compare the discrete epidemic link equations (ELE) and continuous pair quenched mean-field (PQMF) theories with the corresponding stochastic simulations, both theories that reckon pairwise interactions explicitly. We show that ELE converges to the PQMF theory when the time step goes to zero. We performed an epidemic localization analysis considering the inverse participation ratio (IPR). Both theories present the same localization dependence on network degree exponent γ: for γ<5/2 the epidemics are localized on the maximum k-core of networks with a vanishing IPR in the infinite-size limit while, for γ>5/2, the localization happens on hubs that do not form a densely connected set and leads to a finite value of the IPR. However, the IPR and epidemic threshold of ELE depend on the time-step discretization such that a larger time step leads to more localized epidemics. A remarkable difference between discrete- and continuous-time approaches is revealed in the epidemic prevalence near the epidemic threshold, in which the discrete-time stochastic simulations indicate a mean-field critical exponent θ=1 instead of the value θ=1/(3-γ) obtained rigorously and verified numerically for the continuous-time SIS on the same networks.

Synergistic epidemic spreading in correlated networks

We investigate the effect of degree correlation on a susceptible-infected-susceptible (SIS) model with a nonlinear cooperative effect (synergy) in infectious transmissions. In a mean-field treatment of the synergistic SIS model on a bimodal network with tunable degree correlation, we identify a discontinuous transition that is independent of the degree correlation strength unless the synergy is absent or extremely weak. Regardless of synergy (absent or present), a positive and negative degree correlation in the model reduces and raises the epidemic threshold, respectively. For networks with a strongly positive degree correlation, the mean-field treatment predicts the emergence of two discontinuous jumps in the steady-state infected density. To test the mean-field treatment, we provide approximate master equations of the present model. We quantitatively confirm that the approximate master equations agree with not only all qualitative predictions of the mean-field treatment but also corresponding Monte Carlo simulations.

Comparison of theoretical approaches for epidemic processes with waning immunity in complex networks

The role of waning immunity in basic epidemic models on networks has been undervalued while being noticeably fundamental for real epidemic outbreaks. One central question is which mean-field approach is more accurate in describing the epidemic dynamics. We tackled this problem considering the susceptible-infected-recovered-susceptible (SIRS) epidemic model on networks. Two pairwise mean-field theories, one based on recurrent dynamical message-passing (rDMP) theory and the other on the pair quenched mean-field (PQMF) theory, are compared with extensive stochastic simulations on large networks of different levels of heterogeneity. For waning immunity times longer than or comparable with the recovering time, rDMP outperforms PQMF theory on power-law networks with degree distribution P(k)∼k^{-γ}. In particular, for γ>3, the epidemic threshold observed in simulations is finite, in qualitative agreement with rDMP, while PQMF leads to an asymptotically null threshold. The critical epidemic prevalence for γ>3 is localized in a finite set of vertices in the case of the PQMF theory. In contrast, the localization happens in a subextensive fraction of the network in rDMP theory. Simulations, however, indicate that localization patterns of the actual epidemic lay between the two mean-field theories, and improved theoretical approaches are necessary to understanding the SIRS dynamics.

Motif-based mean-field approximation of interacting particles on clustered networks

Interacting particles on graphs are routinely used to study magnetic behavior in physics, disease spread in epidemiology, and opinion dynamics in social sciences. The literature on mean-field approximations of such systems for large graphs typically remains limited to specific dynamics, or assumes cluster-free graphs for which standard approximations based on degrees and pairs are often reasonably accurate. Here, we propose a motif-based mean-field approximation that considers higher-order subgraph structures in large clustered graphs. Numerically, our equations agree with stochastic simulations where existing methods fail.

Dynamics of epidemics from cavity master equations: Susceptible-infectious-susceptible models

We apply the recently introduced cavity master equation (CME) to epidemic models and compare it to previously known approaches. We show that CME seems to be the formal way to derive (and correct) dynamic message passing (rDMP) equations that were previously introduced in an intuitive ad hoc manner. CME outperforms rDMP in all cases studied. Both approximations are nonbacktracking and this causes CME and rDMP to fail when the ecochamber mechanism is relevant, as in loopless topologies or scale free networks. However, we studied several random regular graphs and Erdős-Rényi graphs, where CME outperforms individual based mean field and a type of pair based mean field, although it is less precise than pair quenched mean field. We derive analytical results for endemic thresholds and compare them across different approximations.

From random point processes to hierarchical cavity master equations for stochastic dynamics of disordered systems in random graphs: Ising models and epidemics

We start from the theory of random point processes to derive n-point coupled master equations describing the continuous dynamics of discrete variables in random graphs. These equations constitute a hierarchical set of approximations that generalize and improve the cavity master equation (CME), a recently obtained closure for the usual master equation representing the dynamics. Our derivation clarifies some of the hypotheses and approximations that originally led to the CME, considered now as the first order of a more general technique. We tested the scheme in the dynamics of three models defined over diluted graphs: the Ising ferromagnet, the Viana-Bray spin-glass, and the susceptible-infectious-susceptible model for epidemics. In the first two, the equations perform similarly to the best-known approaches in literature. In the latter, they outperform the well-known pair quenched mean-field approximation.

Multistage onset of epidemics in heterogeneous networks

We develop a theory for the susceptible-infected-susceptible (SIS) epidemic model on networks that incorporate both network structure and dynamic correlations. This theory can account for the multistage onset of the epidemic phase in scale-free networks. This phenomenon is characterized by multiple peaks in the susceptibility as a function of the infection rate. It can be explained by that, even under the global epidemic threshold, a hub can sustain the epidemics for an extended period. Moreover, our approach improves theoretical calculations of prevalence close to the threshold in heterogeneous networks and also can predict the average risk of infection for neighbors of nodes with different degree and state on uncorrelated static networks.

Comparison of Simulations with a Mean-Field Approach vs. Synthetic Correlated Networks

It is well known that dynamical processes on complex networks are influenced by the degree correlations. A common way to take these into account in a mean-field approach is to consider the function knn(k) (average nearest neighbors degree). We re-examine the standard choices of knn for scale-free networks and a new family of functions which is independent from the simple ansatz knn∝kα but still displays a remarkable scale invariance. A rewiring procedure is then used to explicitely construct synthetic networks using the full correlation P(h∣k) from which knn is derived. We consistently find that the knn functions of concrete synthetic networks deviate from ideal assortativity or disassortativity at large k. The consequences of this deviation on a diffusion process (the network Bass diffusion and its peak time) are numerically computed and discussed for some low-dimensional samples. Finally, we check that although the knn functions of the new family have an asymptotic behavior for large networks different from previous estimates, they satisfy the general criterium for the absence of an epidemic threshold.

An overview of epidemic models with phase transitions to absorbing states running on top of complex networks

Dynamical systems running on the top of complex networks have been extensively investigated for decades. But this topic still remains among the most relevant issues in complex network theory due to its range of applicability. The contact process (CP) and the susceptible-infected-susceptible (SIS) model are used quite often to describe epidemic dynamics. Despite their simplicity, these models are robust to predict the kernel of real situations. In this work, we review concisely both processes that are well-known and very applied examples of models that exhibit absorbing-state phase transitions. In the epidemic scenario, individuals can be infected or susceptible. A phase transition between a disease-free (absorbing) state and an active stationary phase (where a fraction of the population is infected) are separated by an epidemic threshold. For the SIS model, the central issue is to determine this epidemic threshold on heterogeneous networks. For the CP model, the main interest is to relate critical exponents with statistical properties of the network.

High prevalence regimes in the pair-quenched mean-field theory for the susceptible-infected-susceptible model on networks

Reckoning of pairwise dynamical correlations significantly improves the accuracy of mean-field theories and plays an important role in the investigation of dynamical processes in complex networks. In this work, we perform a nonperturbative numerical analysis of the quenched mean-field theory (QMF) and the inclusion of dynamical correlations by means of the pair quenched mean-field (PQMF) theory for the susceptible-infected-susceptible model on synthetic and real networks. We show that the PQMF considerably outperforms the standard QMF theory on synthetic networks of distinct levels of heterogeneity and degree correlations, providing extremely accurate predictions when the system is not too close to the epidemic threshold, while the QMF theory deviates substantially from simulations for networks with a degree exponent γ>2.5. The scenario for real networks is more complicated, still with PQMF significantly outperforming the QMF theory. However, despite its high accuracy for most investigated networks, in a few cases PQMF deviations from simulations are not negligible. We found correlations between accuracy and average shortest path, while other basic network metrics seem to be uncorrelated with the theory accuracy. Our results show the viability of the PQMF theory to investigate the high-prevalence regimes of recurrent-state epidemic processes in networks, a regime of high applicability.

Network Rewiring in the r-K Plane

We generate correlated scale-free networks in the configuration model through a new rewiring algorithm that allows one to tune the Newman assortativity coefficient r and the average degree of the nearest neighbors K (in the range −1≤r≤1, K≥〈k〉). At each attempted rewiring step, local variations Δr and ΔK are computed and then the step is accepted according to a standard Metropolis probability exp(±Δr/T), where T is a variable temperature. We prove a general relation between Δr and ΔK, thus finding a connection between two variables that have very different definitions and topological meaning. We describe rewiring trajectories in the r-K plane and explore the limits of maximally assortative and disassortative networks, including the case of small minimum degree (kmin≥1), which has previously not been considered. The size of the giant component and the entropy of the network are monitored in the rewiring. The average number of second neighbors in the branching approximation z¯2,B is proven to be constant in the rewiring, and independent from the correlations for Markovian networks. As a function of the degree, however, the number of second neighbors gives useful information on the network connectivity and is also monitored.

Nonmassive immunization to contain spreading on complex networks

Optimal strategies for epidemic containment are focused on dismantling the contact network through effective immunization with minimal costs. However, network fragmentation is seldom accessible in practice and may present extreme side effects. In this work, we investigate the epidemic containment immunizing population fractions far below the percolation threshold. We report that moderate and weakly supervised immunizations can lead to finite epidemic thresholds of the susceptible-infected-susceptible model on scale-free networks by changing the nature of the transition from a specific motif to a collectively driven process. Both pruning of efficient spreaders and increasing of their mutual separation are necessary for a collective activation. Fractions of immunized vertices needed to eradicate the epidemics which are much smaller than the percolation thresholds were observed for a broad spectrum of real networks considering targeted or acquaintance immunization strategies. Our work contributes for the construction of optimal containment, preserving network functionality through nonmassive and viable immunization strategies.