Accuracy of mean-field theory for dynamics on real-world networks

Network Spreading from Network Dimension

Continuous-state network spreading models provide critical numerical and analytic insights into transmission processes in epidemiology, rumor propagation, knowledge dissemination, and many other areas. Most of these models reflect only local features such as adjacency, degree, and transitivity, so can exhibit substantial error in the presence of global correlations typical of empirical networks. Here, we propose mitigating this limitation via a network property ideally suited to capturing spreading. This is the network correlation dimension, which characterizes how the number of nodes within range of a source typically scales with distance. Applying the approach to susceptible-infected-recovered processes leads to a spreading model which, for a wide range of networks and epidemic parameters, can provide more accurate predictions of the early stages of a spreading process than important established models of substantially higher complexity. In addition, the proposed model leads to a basic reproduction number that provides information about the final state not available from popular established models.

An application of small-world network on predicting the behavior of infectious disease on campus

Networks haven been widely used to understand the spread of infectious disease. This study examines the properties of small-world networks in modeling infectious disease on campus. Two different small-world models are developed and the behaviors of infectious disease in the models are observed through numerical simulations. The results show that the behavior pattern of infectious disease in a small-world network is different from those in a regular network or a random network. The spread of the infectious disease increases as the proportion of long-distance connections p increasing, which indicates that reducing the contact among people is an effective measure to control the spread of infectious disease. The probability of node position exchange in a network (p2) had no significant effect on the spreading speed, which suggests that reducing human mobility in closed environments does not help control infectious disease. However, the spreading speed is proportional to the number of shared nodes (s), which means reducing connections between different groups and dividing students into separate sections will help to control infectious disease. In the end, the simulating speed of the small-world network is tested and the quadratic relationship between simulation time and the number of nodes may limit the application of the SW network in areas with large populations.

Triadic Approximation Reveals the Role of Interaction Overlap on the Spread of Complex Contagions on Higher-Order Networks

Contagion processes relying on the exposure to multiple sources are prevalent in social systems, and are effectively represented by hypergraphs. In this Letter, we derive a mean-field model that goes beyond node- and pair-based approximations. We reveal how the stability of the contagion-free state is decided by either two- or three-body interactions, and how this is strictly related to the degree of overlap between these interactions. Our findings demonstrate the dual effect of increased overlap: it lowers the invasion threshold, yet produces smaller outbreaks. Corroborated by numerical simulations, our results emphasize the significance of the chosen representation in describing a higher-order process.

Epidemic graph diagrams as analytics for epidemic control in the data-rich era

COVID-19 highlighted modeling as a cornerstone of pandemic response. But it also revealed that current models may not fully exploit the high-resolution data on disease progression, epidemic surveillance and host behavior, now available. Take the epidemic threshold, which quantifies the spreading risk throughout epidemic emergence, mitigation, and control. Its use requires oversimplifying either disease or host contact dynamics. We introduce the epidemic graph diagrams to overcome this by computing the epidemic threshold directly from arbitrarily complex data on contacts, disease and interventions. A grammar of diagram operations allows to decompose, compare, simplify models with computational efficiency, extracting theoretical understanding. We use the diagrams to explain the emergence of resistant influenza variants in the 2007-2008 season, and demonstrate that neglecting non-infectious prodromic stages of sexually transmitted infections biases the predicted epidemic risk, compromising control. The diagrams are general, and improve our capacity to respond to present and future public health challenges.

Efficient simulations of epidemic models with tensor networks: Application to the one-dimensional susceptible-infected-susceptible model

The contact process is an emblematic model of a nonequilibrium system, containing a phase transition between inactive and active dynamical regimes. In the epidemiological context, the model is known as the susceptible-infected-susceptible model, and it is widely used to describe contagious spreading. In this work, we demonstrate how accurate and efficient representations of the full probability distribution over all configurations of the contact process on a one-dimensional chain can be obtained by means of matrix product states (MPSs). We modify and adapt MPS methods from many-body quantum systems to study the classical distributions of the driven contact process at late times. We give accurate and efficient results for the distribution of large gaps, and illustrate the advantage of our methods over Monte Carlo simulations. Furthermore, we study the large deviation statistics of the dynamical activity, defined as the total number of configuration changes along a trajectory, and investigate quantum-inspired entropic measures, based on the second Rényi entropy.

Impact of contact rate on epidemic spreading in complex networks

Abstract

Contact reduction is an effective strategy to mitigate the spreading of epidemic. However, the existing reaction-diffusion equations for infectious disease are unable to characterize this effect. Thus, we here propose an extended susceptible-infected-recovered model by incorporating contact rate into the standard SIR model, and concentrate on investigating its impact on epidemic transmission. We analytically derive the epidemic thresholds on homogeneous and heterogeneous networks, respectively. The effects of contact rate on spreading speed, scale and outbreak threshold are explored on ER and SF networks. Simulations results show that epidemic dissemination is significantly mitigated when contact rate is reduced. Importantly, epidemic spreads faster on heterogeneous networks while broader on homogeneous networks, and the outbreak thresholds of the former are smaller.

Graphical abstract

Graphop mean-field limits and synchronization for the stochastic Kuramoto model

Models of coupled oscillator networks play an important role in describing collective synchronization dynamics in biological and technological systems. The Kuramoto model describes oscillator's phase evolution and explains the transition from incoherent to coherent oscillations under simplifying assumptions, including all-to-all coupling with uniform strength. Real world networks, however, often display heterogeneous connectivity and coupling weights that influence the critical threshold for this transition. We formulate a general mean-field theory (Vlasov-Focker Planck equation) for stochastic Kuramoto-type phase oscillator models, valid for coupling graphs/networks with heterogeneous connectivity and coupling strengths, using graphop theory in the mean-field limit. Considering symmetric odd-valued coupling functions, we mathematically prove an exact formula for the critical threshold for the incoherence-coherence transition. We numerically test the predicted threshold using large finite-size representations of the network model. For a large class of graph models, we find that the numerical tests agree very well with the predicted threshold obtained from mean-field theory. However, the prediction is more difficult in practice for graph structures that are sufficiently sparse. Our findings open future research avenues toward a deeper understanding of mean-field theories for heterogeneous systems.

Synchronization in the network-frustrated coupled oscillator with attractive-repulsive frequencies

We investigate the synchronization behavior of a generalized useful mode of the emergent collective behavior in sets of interacting dynamic elements. The network-frustrated Kuramoto model with interaction-repulsion frequency characteristics is presented, and its structural features are crucial to capture the correct physical behavior, such as describing steady states and phase transitions. Quantifying the effect of small-world phenomena on the global synchronization of the given network, the impact of the random phase-shift and their mutual behavior shows particular challenges. In this paper, we derive the phase-locked states and identify the significant synchronization transition points analytically with exact boundary conditions for the correlated and uncorrelated degree-frequency distributions and their full stability analysis. We find that a supercritical to subcritical bifurcation transition occurs depending on the synchronic transition points, characterized by the power scale of the network for the correlated degree frequency and the largest eigenvalue of the network in the uncorrelated case. Furthermore, our frustrated degree-frequency distribution brings us to the classical Kuramoto model with all-to-all coupling, with β=1/2 for the correlated case and λ_{N}=1 for the uncorrelated distribution. In addition, the interplay between the network topology and the frustration forms a powerful alliance, where they control the synchronization ability of the generalized model without affecting its stability.

Estimating comparable distances to tipping points across mutualistic systems by scaled recovery rates

Mutualistic systems can experience abrupt and irreversible regime shifts caused by local or global stressors. Despite decades of efforts to understand ecosystem dynamics and determine whether a tipping point could occur, there are no current approaches to estimate distances (in state/parameter space) to tipping points and compare the distances across various mutualistic systems. Here we develop a general dimension-reduction approach that simultaneously compresses the natural control and state parameters of high-dimensional complex systems and introduces a scaling factor for recovery rates. Our theoretical framework places various systems with entirely different dynamical parameters, network structure and state perturbations on the same scale. More importantly, it compares distances to tipping points across different systems on the basis of data on abundance and topology. By applying the method to 54 real-world mutualistic networks, our analytical results unveil the network characteristics and system parameters that control a system's resilience. We contribute to the ongoing efforts in developing a general framework for mapping and predicting distance to tipping points of ecological and potentially other systems.

Moment closure approximations of susceptible-infected-susceptible epidemics on adaptive networks

The influence of people's individual responses to the spread of contagious phenomena, like the COVID-19 pandemic, is still not well understood. We investigate the Markovian Generalized Adaptive Susceptible-Infected-Susceptible (G-ASIS) epidemic model. The G-ASIS model comprises many contagious phenomena on networks, ranging from epidemics and information diffusion to innovation spread and human brain interactions. The connections between nodes in the G-ASIS model change adaptively over time, because nodes make decisions to create or break links based on the health state of their neighbors. Our contribution is fourfold. First, we rigorously derive the first-order and second-order mean-field approximations from the continuous-time Markov chain. Second, we illustrate that the first-order mean-field approximation fails to approximate the epidemic threshold of the Markovian G-ASIS model accurately. Third, we show that the second-order mean-field approximation is a qualitative good approximation of the Markovian G-ASIS model. Finally, we discuss the Adaptive Information Diffusion (AID) model in detail, which is contained in the G-ASIS model. We show that, similar to most other instances of the G-ASIS model, the AID model possesses a unique steady state, but that in the AID model, the convergence time toward the steady state is very large. Our theoretical results are supported by numerical simulations.

Epidemic management and control through risk-dependent individual contact interventions

Testing, contact tracing, and isolation (TTI) is an epidemic management and control approach that is difficult to implement at scale because it relies on manual tracing of contacts. Exposure notification apps have been developed to digitally scale up TTI by harnessing contact data obtained from mobile devices; however, exposure notification apps provide users only with limited binary information when they have been directly exposed to a known infection source. Here we demonstrate a scalable improvement to TTI and exposure notification apps that uses data assimilation (DA) on a contact network. Network DA exploits diverse sources of health data together with the proximity data from mobile devices that exposure notification apps rely upon. It provides users with continuously assessed individual risks of exposure and infection, which can form the basis for targeting individual contact interventions. Simulations of the early COVID-19 epidemic in New York City are used to establish proof-of-concept. In the simulations, network DA identifies up to a factor 2 more infections than contact tracing when both harness the same contact data and diagnostic test data. This remains true even when only a relatively small fraction of the population uses network DA. When a sufficiently large fraction of the population (≳ 75%) uses network DA and complies with individual contact interventions, targeting contact interventions with network DA reduces deaths by up to a factor 4 relative to TTI. Network DA can be implemented by expanding the computational backend of existing exposure notification apps, thus greatly enhancing their capabilities. Implemented at scale, it has the potential to precisely and effectively control future epidemics while minimizing economic disruption.

During the ongoing COVID-19 pandemic, exposure notification apps have been developed to scale up manual contact tracing. The apps use proximity data from mobile devices to automate notifying direct contacts of an infection source. The information they provide is limited because users receive only rare and binary alerts. Here we present network data assimilation (DA) as a new digital approach to epidemic management and control. Network DA uses the same data as exposure notification apps but uses it more effectively to provide frequently updated individual risk assessments to users.

Network DA is based on automated learning about individuals’ risk of exposure and infection from crowd-sourced health data and proximity data. The data are aggregated with models of disease transmission to produce statistical assessments of users’ risks. In an extensive simulation study of the COVID-19 epidemic in New York City (NYC), we show that network DA with diagnostic testing achieves epidemic control with fewer than half the deaths that occurred during NYC’s lockdown, while isolating a far smaller fraction of the population (typically only 5–10% of the population at any given time).

Implemented at scale, then, network DA has the potential to effectively control epidemics while minimizing economic and social disruption.

Epidemic dynamics on higher-dimensional small world networks

Dimension governs dynamical processes on networks. The social and technological networks which we encounter in everyday life span a wide range of dimensions, but studies of spreading on finite-dimensional networks are usually restricted to one or two dimensions. To facilitate investigation of the impact of dimension on spreading processes, we define a flexible higher-dimensional small world network model and characterize the dependence of its structural properties on dimension. Subsequently, we derive mean field, pair approximation, intertwined continuous Markov chain and probabilistic discrete Markov chain models of a COVID-19-inspired susceptible-exposed-infected-removed (SEIR) epidemic process with quarantine and isolation strategies, and for each model identify the basic reproduction number R 0 , which determines whether an introduced infinitesimal level of infection in an initially susceptible population will shrink or grow. We apply these four continuous state models, together with discrete state Monte Carlo simulations, to analyse how spreading varies with model parameters. Both network properties and the outcome of Monte Carlo simulations vary substantially with dimension or rewiring rate, but predictions of continuous state models change only slightly. A different trend appears for epidemic model parameters: as these vary, the outcomes of Monte Carlo change less than those of continuous state methods. Furthermore, under a wide range of conditions, the four continuous state approximations present similar deviations from the outcome of Monte Carlo simulations. This bias is usually least when using the pair approximation model, varies only slightly with network size, and decreases with dimension or rewiring rate. Finally, we characterize the discrepancies between Monte Carlo and continuous state models by simultaneously considering network efficiency and network size.

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.

The case for altruism in institutional diagnostic testing

Amid COVID-19, many institutions deployed vast resources to test their members regularly for safe reopening. This self-focused approach, however, not only overlooks surrounding communities but also remains blind to community transmission that could breach the institution. To test the relative merits of a more altruistic strategy, we built an epidemiological model that assesses the differential impact on case counts when institutions instead allocate a proportion of their tests to members’ close contacts in the larger community. We found that testing outside the institution benefits the institution in all plausible circumstances, with the optimal proportion of tests to use externally landing at 45% under baseline model parameters. Our results were robust to local prevalence, secondary attack rate, testing capacity, and contact reporting level, yielding a range of optimal community testing proportions from 18 to 58%. The model performed best under the assumption that community contacts are known to the institution; however, it still demonstrated a significant benefit even without complete knowledge of the contact network.

Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes

Despite the vast literature on network dynamics, we still lack basic insights into dynamics on higher-order structures (e.g., edges, triangles, and more generally, k-dimensional "simplices") and how they are influenced through higher-order interactions. A prime example lies in neuroscience where groups of neurons (not individual ones) may provide building blocks for neurocomputation. Here, we study consensus dynamics on edges in simplicial complexes using a type of Laplacian matrix called a Hodge Laplacian, which we generalize to allow higher- and lower-order interactions to have different strengths. Using techniques from algebraic topology, we study how collective dynamics converge to a low-dimensional subspace that corresponds to the homology space of the simplicial complex. We use the Hodge decomposition to show that higher- and lower-order interactions can be optimally balanced to maximally accelerate convergence and that this optimum coincides with a balancing of dynamics on the curl and gradient subspaces. We additionally explore the effects of network topology, finding that consensus over edges is accelerated when two-simplices are well dispersed, as opposed to clustered together.

Identifying asymptomatic spreaders of antimicrobial-resistant pathogens in hospital settings

Antimicrobial-resistant organisms (AMROs) can colonize people without symptoms for long periods of time, during which these agents can spread unnoticed to other patients in healthcare systems. The accurate identification of asymptomatic spreaders of AMRO in hospital settings is essential for supporting the design of interventions against healthcare-associated infections (HAIs). However, this task remains challenging because of limited observations of colonization and the complicated transmission dynamics occurring within hospitals and the broader community. Here, we study the transmission of methicillin-resistant Staphylococcus aureus (MRSA), a prevalent AMRO, in 66 Swedish hospitals and healthcare facilities with inpatients using a data-driven, agent-based model informed by deidentified real-world hospitalization records. Combining the transmission model, patient-to-patient contact networks, and sparse observations of colonization, we develop and validate an individual-level inference approach that estimates the colonization probability of individual hospitalized patients. For both model-simulated and historical outbreaks, the proposed method supports the more accurate identification of asymptomatic MRSA carriers than other traditional approaches. In addition, in silica control experiments indicate that interventions targeted to inpatients with a high-colonization probability outperform heuristic strategies informed by hospitalization history and contact tracing.

Dimension-reduction of dynamics on real-world networks with symmetry

We derive explicit formulae to quantify the Markov chain state-space compression, or lumping, that can be achieved in a broad range of dynamical processes on real-world networks, including models of epidemics and voting behaviour, by exploiting redundancies due to symmetries. These formulae are applied in a large-scale study of such symmetry-induced lumping in real-world networks, from which we identify specific networks for which lumping enables exact analysis that could not have been done on the full state-space. For most networks, lumping gives a state-space compression ratio of up to 10 7 , but the largest compression ratio identified is nearly 10 12 . Many of the highest compression ratios occur in animal social networks. We also present examples of types of symmetry found in real-world networks that have not been previously reported.

Smart testing and selective quarantine for the control of epidemics

This paper is based on the observation that, during Covid-19 epidemic, the choice of which individuals should be tested has an important impact on the effectiveness of selective confinement measures. This decision problem is closely related to the problem of optimal sensor selection, which is a very active research subject in control engineering. The goal of this paper is to propose a policy to smartly select the individuals to be tested. The main idea is to model the epidemics as a stochastic dynamic system and to select the individual to be tested accordingly to some optimality criteria, e.g. to minimize the probability of undetected asymptomatic cases. Every day, the probability of infection of the different individuals is updated making use of the stochastic model of the phenomenon and of the information collected in the previous days. Simulations for a closed community of 10'000 individuals show that the proposed technique, coupled with a selective confinement policy, can reduce the spread of the disease while limiting the number of individuals confined if compared to the simple contact tracing of positive and to an off-line test selection strategy based on the number of contacts.

Spacing ratio characterization of the spectra of directed random networks

Previous literature on random matrix and network science has traditionally employed measures derived from nearest-neighbor level spacing distributions to characterize the eigenvalue statistics of random matrices. This approach, however, depends crucially on eigenvalue unfolding procedures, which in many situations represent a major hindrance due to constraints in the calculation, especially in the case of complex spectra. Here we study the spectra of directed networks using the recently introduced ratios between nearest and next-to-nearest eigenvalue spacing, thus circumventing the shortcomings imposed by spectral unfolding. Specifically, we characterize the eigenvalue statistics of directed Erdős-Rényi (ER) random networks by means of two adjacency matrix representations, namely, (1) weighted non-Hermitian random matrices and (2) a transformation on non-Hermitian adjacency matrices which produces weighted Hermitian matrices. For both representations, we find that the distribution of spacing ratios becomes universal for a fixed average degree, in accordance with undirected random networks. Furthermore, by calculating the average spacing ratio as a function of the average degree, we show that the spectral statistics of directed ER random networks undergoes a transition from Poisson to Ginibre statistics for model 1 and from Poisson to Gaussian unitary ensemble statistics for model 2. Eigenvector delocalization effects of directed networks are also discussed.

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.

Fitting in and breaking up: A nonlinear version of coevolving voter models

We investigate a nonlinear version of coevolving voter models, in which node states and network structure update as a coupled stochastic process. Most prior work on coevolving voter models has focused on linear update rules with fixed and homogeneous rewiring and adopting probabilities. By contrast, in our nonlinear version, the probability that a node rewires or adopts is a function of how well it "fits in" with the nodes in its neighborhood. To explore this idea, we incorporate a local-survey parameter σ_{i} that encodes the fraction of neighbors of an updating node i that share its opinion state. In an update, with probability σ_{i}^{q} (for some nonlinearity parameter q), the updating node rewires; with complementary probability 1-σ_{i}^{q}, the updating node adopts a new opinion state. We study this mechanism using three rewiring schemes: after an updating node deletes one of its discordant edges, it then either (1) "rewires-to-random" by choosing a new neighbor in a random process; (2) "rewires-to-same" by choosing a new neighbor in a random process from nodes that share its state; or (3) "rewires-to-none" by not rewiring at all (akin to "unfriending" on social media). We compare our nonlinear coevolving voter model to several existing linear coevolving voter models on various network architectures. Relative to those models, we find in our model that initial network topology plays a larger role in the dynamics and that the choice of rewiring mechanism plays a smaller role. A particularly interesting feature of our model is that, under certain conditions, the opinion state that is held initially by a minority of the nodes can effectively spread to almost every node in a network if the minority nodes view themselves as the majority. In light of this observation, we relate our results to recent work on the majority illusion in social networks.

Uncertainty propagation in complex networks: From noisy links to critical properties

Many complex networks are built up from empirical data prone to experimental error. Thus, the determination of the specific weights of the links is a noisy measure. Noise propagates to those macroscopic variables researchers are interested in, such as the critical threshold for synchronization of coupled oscillators or for the spreading of a disease. Here, we apply error propagation to estimate the macroscopic uncertainty in the critical threshold for some dynamical processes in networks with noisy links. We obtain closed form expressions for the mean and standard deviation of the critical threshold depending on the properties of the noise and the moments of the degree distribution of the network. The analysis provides confidence intervals for critical predictions when dealing with uncertain measurements or intrinsic fluctuations in empirical networked systems. Furthermore, our results unveil a nonmonotonous behavior of the uncertainty of the critical threshold that depends on the specific network structure.

Concurrency and reachability in treelike temporal networks

Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes and links appear and disappear. We focus on the effects of accessibility, whether there is a temporally consistent path from one node to another, and reachability, the density of the corresponding accessibility graph representation of the temporal network. The level of reachability thus inherently limits the possible extent of any spreading process on the temporal network. We study reachability in terms of the overall levels of temporal concurrency between edges and the structural cohesion of the network agglomerating over all edges. We use simulation results and develop heterogeneous mean-field model predictions for random networks to better quantify how the properties of the underlying temporal network regulate reachability.

Optimizing spreading dynamics in interconnected networks

Adding edges between layers of interconnected networks is an important way to optimize the spreading dynamics. While previous studies mostly focused on the case of adding a single edge, the theoretical optimal strategy for adding multiple edges still need to be studied. In this study, based on the susceptible-infected-susceptible model, we investigate the problem of maximizing the stationary spreading prevalence in interconnected networks. For two isolated networks, we maximize the spreading prevalence near the critical point by choosing multiple interconnecting edges. We present a theoretical analysis based on the discrete-time Markov chain approach to derive the approximate optimal strategy. The optimal interlayer structure predicted by the strategy maximizes the spreading prevalence, meanwhile minimizing the spreading outbreak threshold for the interconnected network simultaneously. Numerical simulations on synthetic and real-world networks show that near the critical point, the proposed strategy gives better performance than connecting large degree nodes and randomly connecting.

Coevolution spreading in complex networks

The propagations of diseases, behaviors and information in real systems are rarely independent of each other, but they are coevolving with strong interactions. To uncover the dynamical mechanisms, the evolving spatiotemporal patterns and critical phenomena of networked coevolution spreading are extremely important, which provide theoretical foundations for us to control epidemic spreading, predict collective behaviors in social systems, and so on. The coevolution spreading dynamics in complex networks has thus attracted much attention in many disciplines. In this review, we introduce recent progress in the study of coevolution spreading dynamics, emphasizing the contributions from the perspectives of statistical mechanics and network science. The theoretical methods, critical phenomena, phase transitions, interacting mechanisms, and effects of network topology for four representative types of coevolution spreading mechanisms, including the coevolution of biological contagions, social contagions, epidemic-awareness, and epidemic-resources, are presented in detail, and the challenges in this field as well as open issues for future studies are also discussed.

Contact Adaption During Epidemics: A Multilayer Network Formulation Approach

People change their physical contacts as a preventive response to infectious disease propagations. Yet, only a few mathematical models consider the coupled dynamics of the disease propagation and the contact adaptation process. This paper presents a model where each agent has a default contact neighborhood set, and switches to a different contact set once she becomes alert about infection among her default contacts. Since each agent can adopt either of two possible neighborhood sets, the overall contact network switches among [Formula: see text] possible configurations. Notably, a two-layer network representation can fully model the underlying adaptive, state-dependent contact network. Contact adaptation influences the size of the disease prevalence and the epidemic threshold-a characteristic measure of a contact network robustness against epidemics-in a nonlinear fashion. Particularly, the epidemic threshold for the presented adaptive contact network belongs to the solution of a nonlinear Perron-Frobenius (NPF) problem, which does not depend on the contact adaptation rate monotonically. Furthermore, the network adaptation model predicts a counter-intuitive scenario where adaptively changing contacts may adversely lead to lower network robustness against epidemic spreading if the contact adaptation is not fast enough. An original result for a class of NPF problems facilitate the analytical developments in this paper.

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.

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree k_{max} of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large k_{max}. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

Exponentially time decaying susceptible-informed (SIT) model for information diffusion process on networks

Modeling information diffusion on networks is a timely topic due to its significance in massive online social media platforms. Models motivated by disease epidemics, such as the Susceptible-Infected-Removed and Susceptible-Infected-Susceptible (SIS), ones have been used for this task, together with threshold models. A key limitation of these models is that the intrinsic time value of information is not accounted for, an important feature for social media applications, since "old" piece of news does not attract adequate attention. We obtain results pertaining to the diffusion size across the diffusion's evolution over time, as well as for early time points that enable us to calculate the phase transition epoch and the epidemic threshold, using mean field approximations. Further, we explicitly calculate the total probability of getting informed for each node depending on its actual path to the single seed node and then propose a novel approach by constructing a Maximum Weight Tree (MWT) to approximate the final fraction of diffusion, with the weight of each node approximating the total probability of getting informed. The MWT approximation is a novel approach that is exact for tree-like network and is specifically designed for sparse networks. It is also fast to compute and provides another general tool for the analyst to obtain accurate approximations of the "epidemic's" size. Extensive comparisons with results based on Monte Carlo simulation of the information diffusion process show that the derived mean field approximations, as well as that employing the MWT one, provide very accurate estimates of the quantities of interest.

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.

NETWORK-ENSEMBLE COMPARISONS WITH STOCHASTIC REWIRING AND VON NEUMANN ENTROPY

Assessing whether a given network is typical or atypical for a random-network ensemble (i.e., network-ensemble comparison) has widespread applications ranging from null-model selection and hypothesis testing to clustering and classifying networks. We develop a framework for network-ensemble comparison by subjecting the network to stochastic rewiring. We study two rewiring processes-uniform and degree-preserved rewiring-which yield random-network ensembles that converge to the Erdős-Rényi and configuration-model ensembles, respectively. We study convergence through von Neumann entropy (VNE)-a network summary statistic measuring information content based on the spectra of a Laplacian matrix-and develop a perturbation analysis for the expected effect of rewiring on VNE. Our analysis yields an estimate for how many rewires are required for a given network to resemble a typical network from an ensemble, offering a computationally efficient quantity for network-ensemble comparison that does not require simulation of the corresponding rewiring process.

Clout, activists and budget: The road to presidency

Political campaigns involve, in the simplest case, two competing campaign groups which try to obtain a majority of votes. We propose a novel mathematical framework to study political campaign dynamics on social networks whose constituents are either political activists or persuadable individuals. Activists are convinced and do not change their opinion and they are able to move around in the social network to motivate persuadable individuals to vote according to their opinion. We describe the influence of the complex interplay between the number of activists, political clout, budgets, and campaign costs on the campaign result. We also identify situations where the choice of one campaign group to send a certain number of activists already pre-determines their victory. Moreover, we show that a candidate’s advantage in terms of political clout can overcome a substantial budget disadvantage or a lower number of activists, as illustrated by the US presidential election 2016.

Complex contagions with timers

There has been a great deal of effort to try to model social influence-including the spread of behavior, norms, and ideas-on networks. Most models of social influence tend to assume that individuals react to changes in the states of their neighbors without any time delay, but this is often not true in social contexts, where (for various reasons) different agents can have different response times. To examine such situations, we introduce the idea of a timer into threshold models of social influence. The presence of timers on nodes delays adoptions-i.e., changes of state-by the agents, which in turn delays the adoptions of their neighbors. With a homogeneously-distributed timer, in which all nodes have the same amount of delay, the adoption order of nodes remains the same. However, heterogeneously-distributed timers can change the adoption order of nodes and hence the "adoption paths" through which state changes spread in a network. Using a threshold model of social contagions, we illustrate that heterogeneous timers can either accelerate or decelerate the spread of adoptions compared to an analogous situation with homogeneous timers, and we investigate the relationship of such acceleration or deceleration with respect to the timer distribution and network structure. We derive an analytical approximation for the temporal evolution of the fraction of adopters by modifying a pair approximation for the Watts threshold model, and we find good agreement with numerical simulations. We also examine our new timer model on networks constructed from empirical data.

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

We present a degree-based theoretical framework to study the susceptible-infected-susceptible (SIS) dynamics on time-varying (rewired) configuration model networks. Using this framework on a given degree distribution, we provide a detailed analysis of the stationary state using the rewiring rate to explore the whole range of the time variation of the structure relative to that of the SIS process. This analysis is suitable for the characterization of the phase transition and leads to three main contributions: (1) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (2) We recover the predictions of a number of existing approaches as limiting cases of our analysis, providing thereby a unifying point of view for the SIS dynamics on random networks. (3) We obtain bounds for the critical exponents of a number of quantities in the stationary state. This allows us to reinterpret the concept of hub-dominated phase transition. Within our framework, it appears as a heterogeneous critical phenomenon: observables for different degree classes have a different scaling with the infection rate. This phenomenon is followed by the successive activation of the degree classes beyond the epidemic threshold.

Zealotry effects on opinion dynamics in the adaptive voter model

The adaptive voter model has been widely studied as a conceptual model for opinion formation processes on time-evolving social networks. Past studies on the effect of zealots, i.e., nodes aiming to spread their fixed opinion throughout the system, only considered the voter model on a static network. Here we extend the study of zealotry to the case of an adaptive network topology co-evolving with the state of the nodes and investigate opinion spreading induced by zealots depending on their initial density and connectedness. Numerical simulations reveal that below the fragmentation threshold a low density of zealots is sufficient to spread their opinion to the whole network. Beyond the transition point, zealots must exhibit an increased degree as compared to ordinary nodes for an efficient spreading of their opinion. We verify the numerical findings using a mean-field approximation of the model yielding a low-dimensional set of coupled ordinary differential equations. Our results imply that the spreading of the zealots' opinion in the adaptive voter model is strongly dependent on the link rewiring probability and the average degree of normal nodes in comparison with that of the zealots. In order to avoid a complete dominance of the zealots' opinion, there are two possible strategies for the remaining nodes: adjusting the probability of rewiring and/or the number of connections with other nodes, respectively.

Targeted Recovery as an Effective Strategy against Epidemic Spreading

We propose a targeted intervention protocol where recovery is restricted to individuals that have the least number of infected neighbours. Our recovery strategy is highly efficient on any kind of network, since epidemic outbreaks are minimal when compared to the baseline scenario of spontaneous recovery. In the case of spatially embedded networks, we find that an epidemic stays strongly spatially confined with a characteristic length scale undergoing a random walk. We demonstrate numerically and analytically that this dynamics leads to an epidemic spot with a flat surface structure and a radius that grows linearly with the spreading rate.

Stability and instability of a neuron network with excitatory and inhibitory small-world connections

This study considers a delayed neural network with excitatory and inhibitory shortcuts. The global stability of the trivial equilibrium is investigated based on Lyapunov's direct method and the delay-dependent criteria are obtained. It is shown that both the excitatory and inhibitory shortcuts decrease the stability interval, but a time delay can be employed as a global stabilizer. In addition, we analyze the bounds of the eigenvalues of the adjacent matrix using matrix perturbation theory and then obtain the generalized sufficient conditions for local stability. The possibility of small inhibitory shortcuts is helpful for maintaining stability. The mechanisms of instability, bifurcation modes, and chaos are also investigated. Compared with methods based on mean-field theory, the proposed method can guarantee the stability of the system in most cases with random events. The proposed method is effective for cases where excitatory and inhibitory shortcuts exist simultaneously in the network.

DEMOGRAPHICS INDUCE EXTINCTION OF DISEASE IN AN SIS MODEL BASED ON CONDITIONAL MARKOV CHAIN

Demographics have significant effects on disease spread in populations and the topological evolution of the underlying networks that represent the populations. In the context of network-based epidemic modeling, Markov chain-based approach and pairwise approximation are two powerful tools — the former can capture stochastic effects of disease transmission dynamics and the latter can characterize the dynamical correlations in each pair of connected individuals. However, to our best knowledge, the study on epidemic spreading in networks relying on these two techniques is still lacking. To fill this gap, in this paper, a deterministic pairwise susceptible–infected–susceptible (SIS) epidemic model with demographics on complex networks with arbitrary degree distributions is studied based on a continuous time conditional Markov chain. This deterministic model is rigorously derived — using the moment generating function — from the Kolmogorov differential equations for the evolution of individuals and pairs. It is found that demographics will induce the extinction of the disease by reducing the basic reproduction number or lowering the epidemic prevalence after the disease prevails. Moreover, due to the demographical effects, the resulting network tends to a homogeneous network with a degree distribution similar to Poisson distribution, irrespective of the initial network structure. Additionally, we find excellent agreement between numerical solutions and individual-based stochastic simulations using both Erdös–Renyi (ER) random and Barabási–Albert (BA) scale-free initial networks. Our results may provide new insights on the understanding of the influence of demographics on epidemic dynamics and network evolution.

Unification of theoretical approaches for epidemic spreading on complex networks

Models of epidemic spreading on complex networks have attracted great attention among researchers in physics, mathematics, and epidemiology due to their success in predicting and controlling scenarios of epidemic spreading in real-world scenarios. To understand the interplay between epidemic spreading and the topology of a contact network, several outstanding theoretical approaches have been developed. An accurate theoretical approach describing the spreading dynamics must take both the network topology and dynamical correlations into consideration at the expense of increasing the complexity of the equations. In this short survey we unify the most widely used theoretical approaches for epidemic spreading on complex networks in terms of increasing complexity, including the mean-field, the heterogeneous mean-field, the quench mean-field, dynamical message-passing, link percolation, and pairwise approximation. We build connections among these approaches to provide new insights into developing an accurate theoretical approach to spreading dynamics on complex networks.

A framework for analyzing contagion in assortative banking networks

We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (i.e., a tendency for small banks to link to large banks). We analyze default cascades triggered by shocking the network and find that the cascade can be understood as an explicit iterated mapping on a set of edge probabilities that converges to a fixed point. We derive a cascade condition, analogous to the basic reproduction number R₀ in epidemic modelling, that characterizes whether or not a single initially defaulted bank can trigger a cascade that extends to a finite fraction of the infinite network. This cascade condition is an easily computed measure of the systemic risk inherent in a given banking network topology. We use percolation theory for random networks to derive a formula for the frequency of global cascades. These analytical results are shown to provide limited quantitative agreement with Monte Carlo simulation studies of finite-sized networks. We show that edge-assortativity, the propensity of nodes to connect to similar nodes, can have a strong effect on the level of systemic risk as measured by the cascade condition. However, the effect of assortativity on systemic risk is subtle, and we propose a simple graph theoretic quantity, which we call the graph-assortativity coefficient, that can be used to assess systemic risk.

Critical Behaviors in Contagion Dynamics

We study the critical behavior of a general contagion model where nodes are either active (e.g., with opinion A, or functioning) or inactive (e.g., with opinion B, or damaged). The transitions between these two states are determined by (i) spontaneous transitions independent of the neighborhood, (ii) transitions induced by neighboring nodes, and (iii) spontaneous reverse transitions. The resulting dynamics is extremely rich including limit cycles and random phase switching. We derive a unifying mean-field theory. Specifically, we analytically show that the critical behavior of systems whose dynamics is governed by processes (i)-(iii) can only exhibit three distinct regimes: (a) uncorrelated spontaneous transition dynamics, (b) contact process dynamics, and (c) cusp catastrophes. This ends a long-standing debate on the universality classes of complex contagion dynamics in mean field and substantially deepens its mathematical understanding.

Limitations of discrete-time approaches to continuous-time contagion dynamics

Continuous-time Markov process models of contagions are widely studied, not least because of their utility in predicting the evolution of real-world contagions and in formulating control measures. It is often the case, however, that discrete-time approaches are employed to analyze such models or to simulate them numerically. In such cases, time is discretized into uniform steps and transition rates between states are replaced by transition probabilities. In this paper, we illustrate potential limitations to this approach. We show how discretizing time leads to a restriction on the values of the model parameters that can accurately be studied. We examine numerical simulation schemes employed in the literature, showing how synchronous-type updating schemes can bias discrete-time formalisms when compared against continuous-time formalisms. Event-based simulations, such as the Gillespie algorithm, are proposed as optimal simulation schemes both in terms of replicating the continuous-time process and computational speed. Finally, we show how discretizing time can affect the value of the epidemic threshold for large values of the infection rate and the recovery rate, even if the ratio between the former and the latter is small.

A model to identify urban traffic congestion hotspots in complex networks

The rapid growth of population in urban areas is jeopardizing the mobility and air quality worldwide. One of the most notable problems arising is that of traffic congestion. With the advent of technologies able to sense real-time data about cities, and its public distribution for analysis, we are in place to forecast scenarios valuable for improvement and control. Here, we propose an idealized model, based on the critical phenomena arising in complex networks, that allows to analytically predict congestion hotspots in urban environments. Results on real cities' road networks, considering, in some experiments, real traffic data, show that the proposed model is capable of identifying susceptible junctions that might become hotspots if mobility demand increases.

Emergence of coexisting percolating clusters in networks

It is commonly assumed in percolation theories that at most one percolating cluster can exist in a network. We show that several coexisting percolating clusters (CPCs) can emerge in networks due to limited mixing, i.e., a finite and sufficiently small number of interlinks between network modules. We develop an approach called modular message passing (MMP) to describe and verify these observations. We demonstrate that the appearance of CPCs is an important source of inaccuracy in previously introduced percolation theories, such as the message passing (MP) approach, which is a state-of-the-art theory based on the belief propagation method. Moreover, we show that the MMP theory improves significantly over the predictions of MP for percolation on synthetic networks with limited mixing and also on several real-world networks. These findings have important implications for understanding the robustness of networks and in quantifying epidemic outbreaks in the susceptible-infected-recovered (SIR) model of disease spread.

Great cities look small

Great cities connect people; failed cities isolate people. Despite the fundamental importance of physical, face-to-face social ties in the functioning of cities, these connectivity networks are not explicitly observed in their entirety. Attempts at estimating them often rely on unrealistic over-simplifications such as the assumption of spatial homogeneity. Here we propose a mathematical model of human interactions in terms of a local strategy of maximizing the number of beneficial connections attainable under the constraint of limited individual travelling-time budgets. By incorporating census and openly available online multi-modal transport data, we are able to characterize the connectivity of geometrically and topologically complex cities. Beyond providing a candidate measure of greatness, this model allows one to quantify and assess the impact of transport developments, population growth, and other infrastructure and demographic changes on a city. Supported by validations of gross domestic product and human immunodeficiency virus infection rates across US metropolitan areas, we illustrate the effect of changes in local and city-wide connectivities by considering the economic impact of two contemporary inter- and intra-city transport developments in the UK: High Speed 2 and London Crossrail. This derivation of the model suggests that the scaling of different urban indicators with population size has an explicitly mechanistic origin.

Infections on Temporal Networks--A Matrix-Based Approach

We extend the concept of accessibility in temporal networks to model infections with a finite infectious period such as the susceptible-infected-recovered (SIR) model. This approach is entirely based on elementary matrix operations and unifies the disease and network dynamics within one algebraic framework. We demonstrate the potential of this formalism for three examples of networks with high temporal resolution: networks of social contacts, sexual contacts, and livestock-trade. Our investigations provide a new methodological framework that can be used, for instance, to estimate the epidemic threshold, a quantity that determines disease parameters, for which a large-scale outbreak can be expected.

Temporal dynamics of connectivity and epidemic properties of growing networks

Traditional mathematical models of epidemic disease had for decades conventionally considered static structure for contacts. Recently, an upsurge of theoretical inquiry has strived towards rendering the models more realistic by incorporating the temporal aspects of networks of contacts, societal and online, that are of interest in the study of epidemics (and other similar diffusion processes). However, temporal dynamics have predominantly focused on link fluctuations and nodal activities, and less attention has been paid to the growth of the underlying network. Many real networks grow: Online networks are evidently in constant growth, and societal networks can grow due to migration flux and reproduction. The effect of network growth on the epidemic properties of networks is hitherto unknown, mainly due to the predominant focus of the network growth literature on the so-called steady state. This paper takes a step towards alleviating this gap. We analytically study the degree dynamics of a given arbitrary network that is subject to growth. We use the theoretical findings to predict the epidemic properties of the network as a function of time. We observe that the introduction of new individuals into the network can enhance or diminish its resilience against endemic outbreaks and investigate how this regime shift depends upon the connectivity of newcomers and on how they establish connections to existing nodes. Throughout, theoretical findings are corroborated with Monte Carlo simulations over synthetic and real networks. The results shed light on the effects of network growth on the future epidemic properties of networks and offers insights for devising a priori immunization strategies.