Accuracy criterion for the mean-field approximation in susceptible-infected-susceptible epidemics on networks

A multilayer network model of interaction between rumor propagation and media influence

Rumors spread among the crowd have an impact on media influence, while media influence also has an impact on rumor dissemination. This article constructs a two-layer rumor media interaction network model, in which the rumors spread in the crowd are described using the susceptibility-apathy-propagation-recovery model, and the media influence is described using the corresponding flow model. The rationality of the model is studied, and then a detailed analysis of the model is conducted. In the simulation section, we undertake a sensitivity analysis of the crucial parameters within our model, focusing particularly on their impact on the basic reproduction number. According to data simulation analysis, the following conclusion can be drawn: First, when the media unilaterally influences the crowd and does not accept feedback from the crowd, the influence of the media will decrease to zero over time, which has a negative effect on the spread of rumors among the crowd (the degree of rumor dissemination decreases). Second, when the media does not affect the audience and accepts feedback from the audience, this state is similar to the media collecting information stage, which is to accept rumors from the audience but temporarily not disclose their thoughts. At this time, both the media influence and the spread of rumors in the audience will decrease. Finally, the model is validated using an actual dataset of rumors. The simulation results show an R-squared value of 0.9606, indicating that the proposed model can accurately simulate rumor propagation in real social networks.

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.

A Mean-Field Approximation of SIR Epidemics on an Erdös-Rényi Network Model

The stochastic nature of epidemic dynamics on a network makes their direct study very challenging. One avenue to reduce the complexity is a mean-field approximation (or mean-field equation) of the dynamics; however, the classic mean-field equation has been shown to perform sub-optimally in many applications. Here, we adapt a recently developed mean-field equation for SIR epidemics on a network in continuous time to the discrete time case. With this new discrete mean-field approximation, this proof-of-concept study shows that, given the density of the network, there is a strong correspondence between the epidemics on an Erdös-Rényi network and a system of discrete equations. Through this connection, we developed a parameter fitting procedure that allowed us to use synthetic daily SIR data to approximate the underlying SIR epidemic parameters on the network. This procedure has improved accuracy in the estimation of the network epidemic parameters as the network density increases, and is extremely cheap computationally.

Analysis of continuous-time Markovian ɛ-SIS epidemics on networks

We analyze continuous-time Markovian ɛ-SIS epidemics with self-infections on the complete graph. The majority of the graphs are analytically intractable, but many physical features of the ɛ-SIS process observed in the complete graph can occur in any other graph. In this work, we illustrate that the timescales of the ɛ-SIS process are related to the eigenvalues of the tridiagonal matrix of the SIS Markov chain. We provide a detailed analysis of all eigenvalues and illustrate that the eigenvalues show staircases, which are caused by the nearly degenerate (but strictly distinct) pairs of eigenvalues. We also illustrate that the ratio between the second-largest and third-largest eigenvalue is a good indicator of metastability in the ɛ-SIS process. Additionally, we show that the epidemic threshold of the Markovian ɛ-SIS process can be accurately approximated by the effective infection rate for which the third-largest eigenvalue of the transition matrix is the smallest. Finally, we derive the exact mean-field solution for the ɛ-SIS process on the complete graph, and we show that the mean-field approximation does not correctly represent the metastable behavior of Markovian ɛ-SIS epidemics.

Game-Theoretic Frameworks for Epidemic Spreading and Human Decision-Making: A Review

This review presents and reviews various solved and open problems in developing, analyzing, and mitigating epidemic spreading processes under human decision-making. We provide a review of a range of epidemic models and explain the pros and cons of different epidemic models. We exhibit the art of coupling between epidemic models and decision models in the existing literature. More specifically, we provide answers to fundamental questions in human decision-making amid epidemics, including what interventions to take to combat the disease, who are decision-makers, and when and how to take interventions, and how to make interventions. Among many decision models, game-theoretic models have become increasingly crucial in modeling human responses or behavior amid epidemics in the last decade. In this review, we motivate the game-theoretic approach to human decision-making amid epidemics. This review provides an overview of the existing literature by developing a multi-dimensional taxonomy, which categorizes existing literature based on multiple dimensions, including (1) types of games, such as differential games, stochastic games, evolutionary games, and static games; (2) types of interventions, such as social distancing, vaccination, quarantine, and taking antidotes; (3) the types of decision-makers, such as individuals, adversaries, and central authorities at different hierarchical levels. A fine-grained dynamic game framework is proposed to capture the essence of game-theoretic decision-making amid epidemics. We showcase three representative frameworks with unique ways of integrating game-theoretic decision-making into the epidemic models from a vast body of literature. Each of the three frameworks has their unique way of modeling and analyzing and develops results from different angles. In the end, we identify several main open problems and research gaps left to be addressed and filled.

{0,1}-Brauer Configuration Algebras and Their Applications in Graph Energy Theory

The energy E(G) of a graph G is the sum of the absolute values of its adjacency matrix. In contrast, the trace norm of a digraph Q, which is the sum of the singular values of the corresponding adjacency matrix, is the oriented version of the energy of a graph. It is worth pointing out that one of the main problems in this theory consists of determining appropriated bounds of these types of energies for significant classes of graphs, digraphs and matrices, provided that, in general, finding out their exact values is a problem of great difficulty. In this paper, the trace norm of a {0,1}-Brauer configuration is introduced. It is estimated and computed by associating suitable families of graphs and posets to Brauer configuration algebras.

Time-dependent solution of the NIMFA equations around the epidemic threshold

The majority of epidemic models are described by non-linear differential equations which do not have a closed-form solution. Due to the absence of a closed-form solution, the understanding of the precise dynamics of a virus is rather limited. We solve the differential equations of the N-intertwined mean-field approximation of the susceptible-infected-susceptible epidemic process with heterogeneous spreading parameters around the epidemic threshold for an arbitrary contact network, provided that the initial viral state vector is small or parallel to the steady-state vector. Numerical simulations demonstrate that the solution around the epidemic threshold is accurate, also above the epidemic threshold and for general initial viral states that are below the steady-state.

Time dependence of susceptible-infected-susceptible epidemics on networks with nodal self-infections

The average fraction of infected nodes, in short the prevalence, of the Markovian ɛ-SIS (susceptible-infected-susceptible) process with small self-infection rate ɛ>0 exhibits, as a function of time, a typical "two-plateau" behavior, which was first discovered in the complete graph K_{N}. Although the complete graph is often dismissed as an unacceptably simplistic approximation, its analytic tractability allows to unravel deeper details, that are surprisingly also observed in other graphs as demonstrated by simulations. The time-dependent mean-field approximation for K_{N} performs only reasonably well for relatively large self-infection rates, but completely fails to mimic the typical Markovian ɛ-SIS process with small self-infection rates. While self-infections, particularly when their rate is small, are usually ignored, the interplay of nodal self-infection and spread over links may explain why absorbing processes are hardly observed in reality, even over long time intervals.

Explosive phase transition in susceptible-infected-susceptible epidemics with arbitrary small but nonzero self-infection rate

The ɛ-susceptible-infected-susceptible (SIS) epidemic model on a graph adds an independent, Poisson self-infection process with rate ɛ to the "classical" Markovian SIS process. The steady state in the classical SIS process (with ɛ=0) on any finite graph is the absorbing or overall-healthy state, in which the virus is eradicated from the network. We report that there always exists a phase transition around τ_{c}^{ɛ}=O(ɛ^{-1/N-1}) in the ɛ-SIS process on the complete graph K_{N} with N nodes, above which the effective infection rate τ>τ_{c}^{ɛ} causes the average steady-state fraction of infected nodes to approach that of the mean-field approximation, no matter how small, but not zero, the self-infection rate ɛ is. For τ<τ_{c}^{ɛ} and small ɛ, the network is almost overall healthy. The observation was found by mathematical analysis on the complete graph K_{N}, but we claim that the phase transition of explosive type may also occur in any other finite graph. We thus conclude that the overall-healthy state of the classical Markovian SIS model is unstable in the ɛ-SIS process and, hence, unlikely to exist in reality, where "background" infection ɛ>0 is imminent.

Explicit non-Markovian susceptible-infected-susceptible mean-field epidemic threshold for Weibull and Gamma infections but Poisson curings

Although non-Markovian processes are considerably more complicated to analyze, real-world epidemics are likely non-Markovian, because the infection time is not always exponentially distributed. Here, we present analytic expressions of the epidemic threshold in a Weibull and a Gamma SIS epidemic on any network, where the infection time is Weibull, respectively, Gamma, but the recovery time is exponential. The theory is compared with precise simulations. The mean-field non-Markovian epidemic thresholds, both for a Weibull and Gamma infection time, are physically similar and interpreted via the occurrence time of an infection during a healthy period of each node in the graph. Our theory couples the type of a viral item, specified by a shape parameter of the Weibull or Gamma distribution, to its corresponding network-wide endemic spreading power, which is specified by the mean-field non-Markovian epidemic threshold in any network.

The road ahead in clinical network neuroscience

Clinical network neuroscience, the study of brain network topology in neurological and psychiatric diseases, has become a mainstay field within clinical neuroscience. Being a multidisciplinary group of clinical network neuroscience experts based in The Netherlands, we often discuss the current state of the art and possible avenues for future investigations. These discussions revolve around questions like "How do dynamic processes alter the underlying structural network?" and "Can we use network neuroscience for disease classification?" This opinion paper is an incomplete overview of these discussions and expands on ten questions that may potentially advance the field. By no means intended as a review of the current state of the field, it is instead meant as a conversation starter and source of inspiration to others.

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.

Disease Localization in Multilayer Networks

We present a continuous formulation of epidemic spreading on multilayer networks using a tensorial representation, extending the models of monoplex networks to this context. We derive analytical expressions for the epidemic threshold of the susceptible-infected-susceptible (SIS) and susceptible-infected-recovered dynamics, as well as upper and lower bounds for the disease prevalence in the steady state for the SIS scenario. Using the quasistationary state method, we numerically show the existence of disease localization and the emergence of two or more susceptibility peaks, which are characterized analytically and numerically through the inverse participation ratio. At variance with what is observed in single-layer networks, we show that disease localization takes place on the layers and not on the nodes of a given layer. Furthermore, when mapping the critical dynamics to an eigenvalue problem, we observe a characteristic transition in the eigenvalue spectra of the supra-contact tensor as a function of the ratio of two spreading rates: If the rate at which the disease spreads within a layer is comparable to the spreading rate across layers, the individual spectra of each layer merge with the coupling between layers. Finally, we report on an interesting phenomenon, the barrier effect; i.e., for a three-layer configuration, when the layer with the lowest eigenvalue is located at the center of the line, it can effectively act as a barrier to the disease. The formalism introduced here provides a unifying mathematical approach to disease contagion in multiplex systems, opening new possibilities for the study of spreading processes.

Networks are all around. They describe the flow of information, the movement of people and goods via multiple modes of transportation, and the spread of disease across interconnected populations. Traditionally, networks have been studied as if they were a single layer, which flattens out hierarchies such as social circles. Multilayer networks, which consider each of those circles as a layer, are more accurate descriptions of real-world networks and their use can have deep implications for understanding the dynamics of the system. Using the spread of disease as a model, we have developed a mathematical framework that accounts for the multilayer structure, and we have identified several behaviors that emerge from this analysis.

The framework relies on tensors, mathematical objects that allow us to represent multidimensional data in a compact way. Through mathematical analysis and numerical simulations, we find a number of interesting features such as the existence of multiple epidemic thresholds and transmission rates beyond which the number of individuals that catch a disease is non-negligible. We also show the existence of disease localization, a scenario in which the disease cannot escape a layer and jump to another.

Our work provides a unifying mathematical approach to studying disease transmission among multilayered populations. There are still many aspects to investigate such as how to use these results to help contain an epidemic as well as how the picture changes in more complex scenarios. Disease-like models can also be used to explore other networks such as the propagation of information.

Epidemics on networks with heterogeneous population and stochastic infection rates

In this paper we study the diffusion of an SIS-type epidemics on a network under the presence of a random environment, that enters in the definition of the infection rates of the nodes. Accordingly, we model the infection rates in the form of independent stochastic processes. To analyze the problem, we apply a mean field approximation, which allows to get a stochastic differential equations for the probability of infection in each node, and classical tools about stability, which require to find suitable Lyapunov's functions. Here, we find conditions which guarantee, respectively, extinction and stochastic persistence of the epidemics. We show that there exists two regions, given in terms of the coefficients of the model, one where the system goes to extinction almost surely, and the other where it is stochastic permanent. These two regions are, unfortunately, not adjacent, as there is a gap between them, whose extension depends on the specific level of noise. In this last region, we perform numerical analysis to suggest the true behavior of the solution.

Approximate formula and bounds for the time-varying susceptible-infected-susceptible prevalence in networks

Based on a recent exact differential equation, the time dependence of the SIS prevalence, the average fraction of infected nodes, in any graph is first studied and then upper and lower bounded by an explicit analytic function of time. That new approximate "tanh formula" obeys a Riccati differential equation and bears resemblance to the classical expression in epidemiology of Kermack and McKendrick [Proc. R. Soc. London A 115, 700 (1927)1364-502110.1098/rspa.1927.0118] but enhanced with graph specific properties, such as the algebraic connectivity, the second smallest eigenvalue of the Laplacian of the graph. We further revisit the challenge of finding tight upper bounds for the SIS (and SIR) epidemic threshold for all graphs. We propose two new upper bounds and show the importance of the variance of the number of infected nodes. Finally, a formula for the epidemic threshold in the cycle (or ring graph) is presented.