1
|
Kuga K, Tanimoto J. Effects of void nodes on epidemic spreads in networks. Sci Rep 2022; 12:3957. [PMID: 35273312 PMCID: PMC8913681 DOI: 10.1038/s41598-022-07985-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/28/2021] [Accepted: 02/22/2022] [Indexed: 11/17/2022] Open
Abstract
We present the pair approximation models for susceptible–infected–recovered (SIR) epidemic dynamics in a sparse network based on a regular network. Two processes are considered, namely, a Markovian process with a constant recovery rate and a non-Markovian process with a fixed recovery time. We derive the implicit analytical expression for the final epidemic size and explicitly show the epidemic threshold in both Markovian and non-Markovian processes. As the connection rate decreases from the original network connection, the epidemic threshold in which epidemic phase transits from disease-free to endemic increases, and the final epidemic size decreases. Additionally, for comparison with sparse and heterogeneous networks, the pair approximation models were applied to a heterogeneous network with a degree distribution. The obtained phase diagram reveals that, upon increasing the degree of the original random regular networks and decreasing the effective connections by introducing void nodes accordingly, the final epidemic size of the sparse network is close to that of the random network with average degree of 4. Thus, introducing the void nodes in the network leads to more heterogeneous network and reduces the final epidemic size.
Collapse
Affiliation(s)
- Kazuki Kuga
- Faculty of Engineering Sciences, Kyushu University, Kasuga-koen, Kasuga-shi, Fukuoka, 816-8580, Japan.
| | - Jun Tanimoto
- Faculty of Engineering Sciences, Kyushu University, Kasuga-koen, Kasuga-shi, Fukuoka, 816-8580, Japan.,Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, Kasuga-koen, Kasuga-shi, Fukuoka, 816-8580, Japan
| |
Collapse
|
2
|
Zhang H, Li GH. Anomalous epidemic spreading in heterogeneous networks. Phys Rev E 2020; 102:012315. [PMID: 32794901 DOI: 10.1103/physreve.102.012315] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/08/2019] [Accepted: 06/25/2020] [Indexed: 06/11/2023]
Abstract
Epidemic spreading in heterogeneous networks has attracted great interest in recent years. To capture the significant effect of residence of individuals on epidemic spreading, we consider herein a simple susceptible-infected-susceptible model with random waiting time in heterogeneous networks. We provide the analytical dynamical expressions for the time evolution for infected individuals and find a fractional memory effect of power-law waiting time on anomalous epidemic spreading. This work provides new quantitative insights in describing contagion processes and could help model other spreading phenomena in social and technological networks.
Collapse
Affiliation(s)
- H Zhang
- State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Chengdu University of Technology, Cheng'du, Si'chuan 610059, China and Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Cheng'du, Si'chuan 610059, China
| | - G H Li
- Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Cheng'du, Si'chuan 610059, China
| |
Collapse
|
3
|
Van Mieghem P, Liu Q. Explicit non-Markovian susceptible-infected-susceptible mean-field epidemic threshold for Weibull and Gamma infections but Poisson curings. Phys Rev E 2020; 100:022317. [PMID: 31574702 PMCID: PMC7219265 DOI: 10.1103/physreve.100.022317] [Citation(s) in RCA: 9] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/10/2019] [Indexed: 11/25/2022]
Abstract
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.
Collapse
Affiliation(s)
- P Van Mieghem
- Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, Delft, The Netherlands
| | - Qiang Liu
- Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, Delft, The Netherlands
| |
Collapse
|
4
|
Equivalence and its invalidation between non-Markovian and Markovian spreading dynamics on complex networks. Nat Commun 2019; 10:3748. [PMID: 31444336 PMCID: PMC6707263 DOI: 10.1038/s41467-019-11763-z] [Citation(s) in RCA: 15] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/09/2019] [Accepted: 07/30/2019] [Indexed: 11/11/2022] Open
Abstract
Epidemic spreading processes in the real world depend on human behaviors and, consequently, are typically non-Markovian in that the key events underlying the spreading dynamics cannot be described as a Poisson random process and the corresponding event time is not exponentially distributed. In contrast to Markovian type of spreading dynamics for which mathematical theories have been well developed, we lack a comprehensive framework to analyze and fully understand non-Markovian spreading processes. Here we develop a mean-field theory to address this challenge, and demonstrate that the theory enables accurate prediction of both the transient phase and the steady states of non-Markovian susceptible-infected-susceptible spreading dynamics on synthetic and empirical networks. We further find that the existence of equivalence between non-Markovian and Markovian spreading depends on a specific edge activation mechanism. In particular, when temporal correlations are absent on active edges, the equivalence can be expected; otherwise, an exact equivalence no longer holds. When modelling epidemic spreading on complex networks, one useful simplification is to assume that the dynamics are Markovian, i.e. memoryless. Here the authors present a more general non-Markovian approach which is able to accurately reproduce the transient and stationary regime on different substrates.
Collapse
|
5
|
Sahneh FD, Vajdi A, Melander J, Scoglio CM. Contact Adaption During Epidemics: A Multilayer Network Formulation Approach. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2019; 6:16-30. [PMID: 34192124 PMCID: PMC7309295 DOI: 10.1109/tnse.2017.2770091] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/04/2016] [Revised: 10/18/2017] [Accepted: 10/28/2017] [Indexed: 05/29/2023]
Abstract
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.
Collapse
Affiliation(s)
- Faryad Darabi Sahneh
- Department of Electrical and Computer EngineeringKansas State UniversityManhattanKS66506
| | - Aram Vajdi
- Department of Electrical and Computer EngineeringKansas State UniversityManhattanKS66506
| | - Joshua Melander
- Department of Electrical and Computer EngineeringKansas State UniversityManhattanKS66506
| | - Caterina M. Scoglio
- Department of Electrical and Computer EngineeringKansas State UniversityManhattanKS66506
| |
Collapse
|
6
|
Liu Q, Van Mieghem P. Burst of virus infection and a possibly largest epidemic threshold of non-Markovian susceptible-infected-susceptible processes on networks. Phys Rev E 2018; 97:022309. [PMID: 29548175 DOI: 10.1103/physreve.97.022309] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/30/2017] [Indexed: 11/07/2022]
Abstract
Since a real epidemic process is not necessarily Markovian, the epidemic threshold obtained under the Markovian assumption may be not realistic. To understand general non-Markovian epidemic processes on networks, we study the Weibullian susceptible-infected-susceptible (SIS) process in which the infection process is a renewal process with a Weibull time distribution. We find that, if the infection rate exceeds 1/ln(λ_{1}+1), where λ_{1} is the largest eigenvalue of the network's adjacency matrix, then the infection will persist on the network under the mean-field approximation. Thus, 1/ln(λ_{1}+1) is possibly the largest epidemic threshold for a general non-Markovian SIS process with a Poisson curing process under the mean-field approximation. Furthermore, non-Markovian SIS processes may result in a multimodal prevalence. As a byproduct, we show that a limiting Weibullian SIS process has the potential to model bursts of a synchronized infection.
Collapse
Affiliation(s)
- Qiang Liu
- Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
| | - Piet Van Mieghem
- Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
| |
Collapse
|
7
|
Abstract
The duration of the infectious period is a crucial determinant of the ability of an infectious disease to spread. We consider an epidemic model that is network based and non-Markovian, containing classic Kermack-McKendrick, pairwise, message passing, and spatial models as special cases. For this model, we prove a monotonic relationship between the variability of the infectious period (with fixed mean) and the probability that the infection will reach any given subset of the population by any given time. For certain families of distributions, this result implies that epidemic severity is decreasing with respect to the variance of the infectious period. The striking importance of this relationship is demonstrated numerically. We then prove, with a fixed basic reproductive ratio (R_{0}), a monotonic relationship between the variability of the posterior transmission probability (which is a function of the infectious period) and the probability that the infection will reach any given subset of the population by any given time. Thus again, even when R_{0} is fixed, variability of the infectious period tends to dampen the epidemic. Numerical results illustrate this but indicate the relationship is weaker. We then show how our results apply to message passing, pairwise, and Kermack-McKendrick epidemic models, even when they are not exactly consistent with the stochastic dynamics. For Poissonian contact processes, and arbitrarily distributed infectious periods, we demonstrate how systems of delay differential equations and ordinary differential equations can provide upper and lower bounds, respectively, for the probability that any given individual has been infected by any given time.
Collapse
Affiliation(s)
- Robert R Wilkinson
- Department of Applied Mathematics, Liverpool John Moores University, Byrom Street, Liverpool L3 5UX, England, United Kingdom
- Department of Mathematical Sciences, The University of Liverpool, Peach Street, Liverpool L69 7ZL, England, United Kingdom
| | - Kieran J Sharkey
- Department of Mathematical Sciences, The University of Liverpool, Peach Street, Liverpool L69 7ZL, England, United Kingdom
| |
Collapse
|
8
|
Devriendt K, Van Mieghem P. Unified mean-field framework for susceptible-infected-susceptible epidemics on networks, based on graph partitioning and the isoperimetric inequality. Phys Rev E 2017; 96:052314. [PMID: 29347672 DOI: 10.1103/physreve.96.052314] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/14/2017] [Indexed: 06/07/2023]
Abstract
We propose an approximation framework that unifies and generalizes a number of existing mean-field approximation methods for the susceptible-infected-susceptible (SIS) epidemic model on complex networks. We derive the framework, which we call the unified mean-field framework (UMFF), as a set of approximations of the exact Markovian SIS equations. Our main novelty is that we describe the mean-field approximations from the perspective of the isoperimetric problem, which results in bounds on the UMFF approximation error. These new bounds provide insight in the accuracy of existing mean-field methods, such as the N-intertwined mean-field approximation and heterogeneous mean-field method, which are contained by UMFF. Additionally, the isoperimetric inequality relates the UMFF approximation accuracy to the regularity notions of Szemerédi's regularity lemma.
Collapse
Affiliation(s)
- K Devriendt
- Delft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O Box 5031, 2600 GA Delft, the Netherlands
| | - P Van Mieghem
- Delft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, P.O Box 5031, 2600 GA Delft, the Netherlands
| |
Collapse
|
9
|
Starnini M, Gleeson JP, Boguñá M. Equivalence between Non-Markovian and Markovian Dynamics in Epidemic Spreading Processes. PHYSICAL REVIEW LETTERS 2017; 118:128301. [PMID: 28388191 DOI: 10.1103/physrevlett.118.128301] [Citation(s) in RCA: 13] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/10/2017] [Indexed: 05/12/2023]
Abstract
A general formalism is introduced to allow the steady state of non-Markovian processes on networks to be reduced to equivalent Markovian processes on the same substrates. The example of an epidemic spreading process is considered in detail, where all the non-Markovian aspects are shown to be captured within a single parameter, the effective infection rate. Remarkably, this result is independent of the topology of the underlying network, as demonstrated by numerical simulations on two-dimensional lattices and various types of random networks. Furthermore, an analytic approximation for the effective infection rate is introduced, which enables the calculation of the critical point and of the critical exponents for the non-Markovian dynamics.
Collapse
Affiliation(s)
- Michele Starnini
- Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, E-08028 Barcelona, Spain
- Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, 08028 Barcelona, Spain
| | - James P Gleeson
- MACSI, Department of Mathematics and Statistics, University of Limerick, Limerick, Ireland
| | - Marián Boguñá
- Departament de Física de la Matèria Condensada, Universitat de Barcelona, Martí i Franquès 1, E-08028 Barcelona, Spain
- Universitat de Barcelona Institute of Complex Systems (UBICS), Universitat de Barcelona, 08028 Barcelona, Spain
| |
Collapse
|
10
|
Sherborne N, Blyuss KB, Kiss IZ. Compact pairwise models for epidemics with multiple infectious stages on degree heterogeneous and clustered networks. J Theor Biol 2016; 407:387-400. [PMID: 27423527 DOI: 10.1016/j.jtbi.2016.07.015] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/10/2016] [Revised: 05/28/2016] [Accepted: 07/10/2016] [Indexed: 12/19/2022]
Abstract
This paper presents a compact pairwise model describing the spread of multi-stage epidemics on networks. The multi-stage model corresponds to a gamma-distributed infectious period which interpolates between the classical Markovian models with exponentially distributed infectious period and epidemics with a constant infectious period. We show how the compact approach leads to a system of equations whose size is independent of the range of node degrees, thus significantly reducing the complexity of the model. Network clustering is incorporated into the model to provide a more accurate representation of realistic contact networks, and the accuracy of proposed closures is analysed for different levels of clustering and number of infection stages. Our results support recent findings that standard closure techniques are likely to perform better when the infectious period is constant.
Collapse
Affiliation(s)
- N Sherborne
- Department of Mathematics, University of Sussex, Brighton BN1 9QH, UK
| | - K B Blyuss
- Department of Mathematics, University of Sussex, Brighton BN1 9QH, UK.
| | - I Z Kiss
- Department of Mathematics, University of Sussex, Brighton BN1 9QH, UK
| |
Collapse
|
11
|
Ogura M, Preciado VM. Epidemic processes over adaptive state-dependent networks. Phys Rev E 2016; 93:062316. [PMID: 27415289 DOI: 10.1103/physreve.93.062316] [Citation(s) in RCA: 33] [Impact Index Per Article: 4.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/26/2016] [Indexed: 11/06/2022]
Abstract
In this paper we study the dynamics of epidemic processes taking place in adaptive networks of arbitrary topology. We focus our study on the adaptive susceptible-infected-susceptible (ASIS) model, where healthy individuals are allowed to temporarily cut edges connecting them to infected nodes in order to prevent the spread of the infection. In this paper we derive a closed-form expression for a lower bound on the epidemic threshold of the ASIS model in arbitrary networks with heterogeneous node and edge dynamics. For networks with homogeneous node and edge dynamics, we show that the resulting lower bound is proportional to the epidemic threshold of the standard SIS model over static networks, with a proportionality constant that depends on the adaptation rates. Furthermore, based on our results, we propose an efficient algorithm to optimally tune the adaptation rates in order to eradicate epidemic outbreaks in arbitrary networks. We confirm the tightness of the proposed lower bounds with several numerical simulations and compare our optimal adaptation rates with popular centrality measures.
Collapse
Affiliation(s)
- Masaki Ogura
- University of Pennsylvania, 3330 Walnut Street, Philadelphia, Pennsylvania 19104, USA
| | - Victor M Preciado
- University of Pennsylvania, 3330 Walnut Street, Philadelphia, Pennsylvania 19104, USA
| |
Collapse
|
12
|
Van Mieghem P. Approximate formula and bounds for the time-varying susceptible-infected-susceptible prevalence in networks. Phys Rev E 2016; 93:052312. [PMID: 27300915 DOI: 10.1103/physreve.93.052312] [Citation(s) in RCA: 21] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/01/2016] [Indexed: 11/07/2022]
Abstract
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.
Collapse
Affiliation(s)
- P Van Mieghem
- Delft University of Technology, Faculty of EECS, P.O. Box 5031, 2600 GA Delft, The Netherlands
| |
Collapse
|
13
|
van de Bovenkamp R, Van Mieghem P. Survival time of the susceptible-infected-susceptible infection process on a graph. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2015; 92:032806. [PMID: 26465527 DOI: 10.1103/physreve.92.032806] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 07/22/2014] [Indexed: 06/05/2023]
Abstract
The survival time T is the longest time that a virus, a meme, or a failure can propagate in a network. Using the hitting time of the absorbing state in an uniformized embedded Markov chain of the continuous-time susceptible-infected-susceptible (SIS) Markov process, we derive an exact expression for the average survival time E[T] of a virus in the complete graph K_{N} and the star graph K_{1,N-1}. By using the survival time, instead of the average fraction of infected nodes, we propose a new method to approximate the SIS epidemic threshold τ_{c} that, at least for K_{N} and K_{1,N-1}, correctly scales with the number of nodes N and that is superior to the epidemic threshold τ_{c}^{(1)}=1/λ_{1} of the N-intertwined mean-field approximation, where λ_{1} is the spectral radius of the adjacency matrix of the graph G. Although this new approximation of the epidemic threshold offers a more intuitive understanding of the SIS process, it remains difficult to compare outbreaks in different graph types. For example, the survival in an arbitrary graph seems upper bounded by the complete graph and lower bounded by the star graph as a function of the normalized effective infection rate τ/τ_{c}^{(1)}. However, when the average fraction of infected nodes is used as a basis for comparison, the virus will survive in the star graph longer than in any other graph, making the star graph the worst-case graph instead of the complete graph. Finally, in non-Markovian SIS, the distribution of the spreading attempts over the infectious period of a node influences the survival time, even if the expected number of spreading attempts during an infectious period (the non-Markovian equivalent of the effective infection rate) is kept constant. Both early and late infection attempts lead to shorter survival times. Interestingly, just as in Markovian SIS, the survival times appear to be exponentially distributed, regardless of the infection and curing time distributions.
Collapse
|
14
|
Kiss IZ, Röst G, Vizi Z. Generalization of Pairwise Models to non-Markovian Epidemics on Networks. PHYSICAL REVIEW LETTERS 2015; 115:078701. [PMID: 26317749 DOI: 10.1103/physrevlett.115.078701] [Citation(s) in RCA: 23] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/21/2015] [Indexed: 05/12/2023]
Abstract
In this Letter, a generalization of pairwise models to non-Markovian epidemics on networks is presented. For the case of infectious periods of fixed length, the resulting pairwise model is a system of delay differential equations, which shows excellent agreement with results based on stochastic simulations. Furthermore, we analytically compute a new R_{0}-like threshold quantity and an analytical relation between this and the final epidemic size. Additionally, we show that the pairwise model and the analytic results can be generalized to an arbitrary distribution of the infectious times, using integro-differential equations, and this leads to a general expression for the final epidemic size. By showing the rigorous link between non-Markovian dynamics and pairwise delay differential equations, we provide the framework for a more systematic understanding of non-Markovian dynamics.
Collapse
Affiliation(s)
- Istvan Z Kiss
- Department of Mathematics, School of Mathematical and Physical Sciences, University of Sussex, Falmer, Brighton BN1 9QH, United Kingdom
| | - Gergely Röst
- Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, Szeged 6720, Hungary
| | - Zsolt Vizi
- Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, Szeged 6720, Hungary
| |
Collapse
|
15
|
Wang W, Tang M, Zhang HF, Lai YC. Dynamics of social contagions with memory of nonredundant information. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2015; 92:012820. [PMID: 26274238 DOI: 10.1103/physreve.92.012820] [Citation(s) in RCA: 18] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/26/2015] [Indexed: 05/20/2023]
Abstract
A key ingredient in social contagion dynamics is reinforcement, as adopting a certain social behavior requires verification of its credibility and legitimacy. Memory of nonredundant information plays an important role in reinforcement, which so far has eluded theoretical analysis. We first propose a general social contagion model with reinforcement derived from nonredundant information memory. Then, we develop a unified edge-based compartmental theory to analyze this model, and a remarkable agreement with numerics is obtained on some specific models. We use a spreading threshold model as a specific example to understand the memory effect, in which each individual adopts a social behavior only when the cumulative pieces of information that the individual received from his or her neighbors exceeds an adoption threshold. Through analysis and numerical simulations, we find that the memory characteristic markedly affects the dynamics as quantified by the final adoption size. Strikingly, we uncover a transition phenomenon in which the dependence of the final adoption size on some key parameters, such as the transmission probability, can change from being discontinuous to being continuous. The transition can be triggered by proper parameters and structural perturbations to the system, such as decreasing individuals' adoption threshold, increasing initial seed size, or enhancing the network heterogeneity.
Collapse
Affiliation(s)
- Wei Wang
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054, China
| | - Ming Tang
- Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054, China
- State key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
| | - Hai-Feng Zhang
- School of Mathematical Science, Anhui University, Hefei 230039, China
| | - Ying-Cheng Lai
- School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, Arizona 85287, USA
| |
Collapse
|
16
|
Chalub FA, Souza MO. Discrete and continuous SIS epidemic models: A unifying approach. ECOLOGICAL COMPLEXITY 2014. [DOI: 10.1016/j.ecocom.2014.01.006] [Citation(s) in RCA: 14] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
|
17
|
Darabi Sahneh F, Scoglio C. Competitive epidemic spreading over arbitrary multilayer networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2014; 89:062817. [PMID: 25019843 DOI: 10.1103/physreve.89.062817] [Citation(s) in RCA: 26] [Impact Index Per Article: 2.6] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/30/2013] [Indexed: 05/05/2023]
Abstract
This study extends the Susceptible-Infected-Susceptible (SIS) epidemic model for single-virus propagation over an arbitrary graph to an Susceptible-Infected by virus 1-Susceptible-Infected by virus 2-Susceptible (SI_{1}SI_{2}S) epidemic model of two exclusive, competitive viruses over a two-layer network with generic structure, where network layers represent the distinct transmission routes of the viruses. We find analytical expressions determining extinction, coexistence, and absolute dominance of the viruses after we introduce the concepts of survival threshold and absolute-dominance threshold. The main outcome of our analysis is the discovery and proof of a region for long-term coexistence of competitive viruses in nontrivial multilayer networks. We show coexistence is impossible if network layers are identical yet possible if network layers are distinct. Not only do we rigorously prove a region of coexistence, but we can quantitate it via interrelation of central nodes across the network layers. Little to no overlapping of the layers' central nodes is the key determinant of coexistence. For example, we show both analytically and numerically that positive correlation of network layers makes it difficult for a virus to survive, while in a network with negatively correlated layers, survival is easier, but total removal of the other virus is more difficult.
Collapse
Affiliation(s)
- Faryad Darabi Sahneh
- Electrical and Computer Engineering Department, Kansas State University, Manhattan, Kansas 66506, USA and and Institute of Computational Comparative Medicine, Kansas State University, Manhattan, Kansas 66506, USA
| | - Caterina Scoglio
- Electrical and Computer Engineering Department, Kansas State University, Manhattan, Kansas 66506, USA and and Institute of Computational Comparative Medicine, Kansas State University, Manhattan, Kansas 66506, USA
| |
Collapse
|
18
|
Cator E, Van Mieghem P. Nodal infection in Markovian susceptible-infected-susceptible and susceptible-infected-removed epidemics on networks are non-negatively correlated. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2014; 89:052802. [PMID: 25353839 DOI: 10.1103/physreve.89.052802] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/07/2013] [Indexed: 06/04/2023]
Abstract
By invoking the famous Fortuin, Kasteleyn, and Ginibre (FKG) inequality, we prove the conjecture that the correlation of infection at the same time between any pair of nodes in a network cannot be negative for (exact) Markovian susceptible-infected-susceptible (SIS) and susceptible-infected-removed (SIR) epidemics on networks. The truth of the conjecture establishes that the N-intertwined mean-field approximation (NIMFA) upper bounds the infection probability in any graph so that network design based on NIMFA always leads to safe protections against malware spread. However, when the infection or/and curing are not Poisson processes, the infection correlation between two nodes can be negative.
Collapse
Affiliation(s)
- E Cator
- Faculty of Science, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
| | - P Van Mieghem
- Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, Delft, The Netherlands
| |
Collapse
|
19
|
van de Bovenkamp R, Kuipers F, Van Mieghem P. Domination-time dynamics in susceptible-infected-susceptible virus competition on networks. PHYSICAL REVIEW. E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS 2014; 89:042818. [PMID: 24827304 DOI: 10.1103/physreve.89.042818] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 10/07/2013] [Indexed: 05/27/2023]
Abstract
When two viruses compete for healthy nodes in a simple network and both spreading rates are above the epidemic threshold, only one virus will survive. However, if we prevent the viruses from dying out, rich dynamics emerge. When both viruses are identical, one virus always dominates the other, but the dominating and dominated virus alternate. We show in the complete graph that the domination time depends on the total number of infected nodes at the beginning of the domination period and, moreover, that the distribution of the domination time decays exponentially yet slowly. When the viruses differ moderately in strength and/or speed the weaker and/or slower virus can still dominate the other but for a short time. Interestingly, depending on the number of infected nodes at the start of a domination period, being quicker can be a disadvantage.
Collapse
Affiliation(s)
- Ruud van de Bovenkamp
- Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, the Netherlands
| | - Fernando Kuipers
- Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, the Netherlands
| | - Piet Van Mieghem
- Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, the Netherlands
| |
Collapse
|