Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks

Duality between predictability and reconstructability in complex systems

Predicting the evolution of a large system of units using its structure of interaction is a fundamental problem in complex system theory. And so is the problem of reconstructing the structure of interaction from temporal observations. Here, we find an intricate relationship between predictability and reconstructability using an information-theoretical point of view. We use the mutual information between a random graph and a stochastic process evolving on this random graph to quantify their codependence. Then, we show how the uncertainty coefficients, which are intimately related to that mutual information, quantify our ability to reconstruct a graph from an observed time series, and our ability to predict the evolution of a process from the structure of its interactions. We provide analytical calculations of the uncertainty coefficients for many different systems, including continuous deterministic systems, and describe a numerical procedure when exact calculations are intractable. Interestingly, we find that predictability and reconstructability, even though closely connected by the mutual information, can behave differently, even in a dual manner. We prove how such duality universally emerges when changing the number of steps in the process. Finally, we provide evidence that predictability-reconstruction dualities may exist in dynamical processes on real networks close to criticality.

Compressing the Chronology of a Temporal Network with Graph Commutators

Studies of dynamics on temporal networks often represent the network as a series of "snapshots," static networks active for short durations of time. We argue that successive snapshots can be aggregated if doing so has little effect on the overlying dynamics. We propose a method to compress network chronologies by progressively combining pairs of snapshots whose matrix commutators have the smallest dynamical effect. We apply this method to epidemic modeling on real contact tracing data and find that it allows for significant compression while remaining faithful to the epidemic dynamics.

Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks

Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts, best described by a higher-order network structure. We model contagions on higher-order networks using group-based approximate master equations, in which we track all states and interactions within a group of nodes and assume a mean-field coupling between them. Using the susceptible-infected-susceptible dynamics, our approach reveals the existence of a mesoscopic localization regime, where a disease can concentrate and self-sustain only around large groups in the network overall organization. In this regime, the phase transition is smeared, characterized by an inhomogeneous activation of the groups. At the mesoscopic level, we observe that the distribution of infected nodes within groups of the same size can be very dispersed, even bimodal. When considering heterogeneous networks, both at the level of nodes and at the level of groups, we characterize analytically the region associated with mesoscopic localization in the structural parameter space. We put in perspective this phenomenon with eigenvector localization and discuss how a focus on higher-order structures is needed to discern the more subtle localization at the mesoscopic level. Finally, we discuss how mesoscopic localization affects the response to structural interventions and how this framework could provide important insights for a broad range of dynamics.

Optimal networks for dynamical spreading

The inverse problem of finding the optimal network structure for a specific type of dynamical process stands out as one of the most challenging problems in network science. Focusing on the susceptible-infected-susceptible type of dynamics on annealed networks whose structures are fully characterized by the degree distribution, we develop an analytic framework to solve the inverse problem. We find that, for relatively low or high infection rates, the optimal degree distribution is unique, which consists of no more than two distinct nodal degrees. For intermediate infection rates, the optimal degree distribution is multitudinous and can have a broader support. We also find that, in general, the heterogeneity of the optimal networks decreases with the infection rate. A surprising phenomenon is the existence of a specific value of the infection rate for which any degree distribution would be optimal in generating maximum spreading prevalence. The analytic framework and the findings provide insights into the interplay between network structure and dynamical processes with practical implications.

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.

Cumulative Merging Percolation and the Epidemic Transition of the Susceptible-Infected-Susceptible Model in Networks

We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which represents a generalization of degree-ordered percolation, we derive a scaling solution on uncorrelated complex networks, unveiling the existence of diverse mechanisms leading to the formation of a percolating cluster. The scaling solution accurately reproduces universal properties of the transition. This finding is used to infer the critical properties of the susceptible-infected-susceptible model for epidemics in infinite and finite power-law distributed networks. Here, discrepancies between analytical approaches and numerical results regarding the finite-size scaling of the epidemic threshold are a crucial open issue in the literature. We find that the scaling exponent assumes a nontrivial value during a long preasymptotic regime. We calculate this value, finding good agreement with numerical evidence. We also show that the crossover to the true asymptotic regime occurs for sizes much beyond currently feasible simulations. Our findings allow us to rationalize and reconcile all previously published results (both analytical and numerical), thus ending a long-standing debate.

Complex networks represent the interaction pattern for many real-world phenomena such as epidemic spreading. The simplest and most fundamental model for the diffusion of infectious diseases without acquired immunity predicts a vanishing epidemic threshold in the limit of large systems. In other words, no matter how small the infectiousness of the disease, there is always a finite fraction of the overall population which is infected for long times. So far, the detailed mechanism underlying this phenomenology has remained unclear. Here, we provide a complete and quantitative understanding of the model’s behavior.

While the role of hubs (individuals with high connectivity) was already believed to be important, we fully clarify its nature, pointing out the highly nontrivial interplay among hubs. Each hub acts as an infection hotbed and the global epidemic emerges from hubs reinfecting each other. Surprisingly, this mechanism is at work even when the hubs are not in direct mutual contact but transmit the infection through chains of low-connectivity individuals. The survival of the epidemic is then a manifestation of a novel, long-range, percolation process among distant hubs, whose properties explain the behavior of the epidemic model.

These findings rationalize and reconcile previously published results and point out long-range indirect interactions as potentially crucial ingredients for other collective phenomena in networked systems.

Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm

Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phenomena on complex networks. Using insights and analytical results from network science, we discuss how the structure of contacts affects the efficiency of current algorithms. We show that algorithms believed to require O ( log  N ) or even O ( 1 ) operations per update-where N is the number of nodes-display instead a polynomial scaling for networks that are either dense or sparse and heterogeneous. This significantly affects the required computation time for simulations on large networks. To circumvent the issue, we propose a node-based method combined with a composition and rejection algorithm, a sampling scheme that has an average-case complexity of O [ log ( log  N ) ] per update for general networks. This systematic approach is first set-up for Markovian dynamics, but can also be adapted to a number of non-Markovian processes and can enhance considerably the study of a wide range of dynamics on networks.

Activation thresholds in epidemic spreading with motile infectious agents on scale-free networks

We investigate a fermionic susceptible-infected-susceptible model with the mobility of infected individuals on uncorrelated scale-free networks with power-law degree distributions P ( k ) ∼ k - γ of exponents 2 < γ < 3 . Two diffusive processes with diffusion rate D of an infected vertex are considered. In the standard diffusion, one of the nearest-neighbors is chosen with equal chance, while in the biased diffusion, this choice happens with probability proportional to the neighbor's degree. A non-monotonic dependence of the epidemic threshold on D with an optimum diffusion rate D ∗ , for which the epidemic spreading is more efficient, is found for standard diffusion while monotonic decays are observed in the biased case. The epidemic thresholds go to zero as the network size is increased and the form that this happens depends on the diffusion rule and the degree exponent. We analytically investigated the dynamics using quenched and heterogeneous mean-field theories. The former presents, in general, a better performance for standard and the latter for biased diffusion models, indicating different activation mechanisms of the epidemic phases that are rationalized in terms of hubs or max k -core subgraphs.

A colored mean-field model for analyzing the effects of awareness on epidemic spreading in multiplex networks

We study the impact of susceptible nodes' awareness on epidemic spreading in social systems, where the systems are modeled as multiplex networks coupled with an information layer and a contact layer. We develop a colored heterogeneous mean-field model taking into account the portion of the overlapping neighbors in the two layers. With theoretical analysis and numerical simulations, we derive the epidemic threshold which determines whether the epidemic can prevail in the population and find that the impacts of awareness on threshold value only depend on epidemic information being available in network nodes' overlapping neighborhood. When there is no link overlap between the two network layers, the awareness cannot help one to raise the epidemic threshold. Such an observation is different from that in a single-layer network, where the existence of awareness almost always helps.

Robustness and fragility of the susceptible-infected-susceptible epidemic models on complex networks

We analyze two alterations of the standard susceptible-infected-susceptible (SIS) dynamics that preserve the central properties of spontaneous healing and infection capacity of a vertex increasing unlimitedly with its degree. All models have the same epidemic thresholds in mean-field theories but depending on the network properties, simulations yield a dual scenario, in which the epidemic thresholds of the modified SIS models can be either dramatically altered or remain unchanged in comparison with the standard dynamics. For uncorrelated synthetic networks having a power-law degree distribution with exponent γ<5/2, the SIS dynamics are robust exhibiting essentially the same outcomes for all investigated models. A threshold in better agreement with the heterogeneous rather than quenched mean-field theory is observed in the modified dynamics for exponent γ>5/2. Differences are more remarkable for γ>3, where a finite threshold is found in the modified models in contrast with the vanishing threshold of the original one. This duality is elucidated in terms of epidemic lifespan on star graphs. We verify that the activation of the modified SIS models is triggered in the innermost component of the network given by a k-core decomposition for γ<3 while it happens only for γ<5/2 in the standard model. For γ>3, the activation in the modified dynamics is collective involving essentially the whole network while it is triggered by hubs in the standard SIS. The duality also appears in the finite-size scaling of the critical quantities where mean-field behaviors are observed for the modified but not for the original dynamics. Our results feed the discussions about the most proper conceptions of epidemic models to describe real systems and the choices of the most suitable theoretical approaches to deal with these models.

Autocorrelation of the susceptible-infected-susceptible process on networks

In this paper, we focus on the autocorrelation of the susceptible-infected-susceptible (SIS) process on networks. The N-intertwined mean-field approximation (NIMFA) is applied to calculate the autocorrelation properties of the exact SIS process. We derive the autocorrelation of the infection state of each node and the fraction of infected nodes both in the steady and transient states as functions of the infection probabilities of nodes. Moreover, we show that the autocorrelation can be used to estimate the infection and curing rates of the SIS process. The theoretical results are compared with the simulation of the exact SIS process. Our work fully utilizes the potential of the mean-field method and shows that NIMFA can indeed capture the autocorrelation properties of the exact SIS process.