Contact process with exogenous infection and the scaled SIS process

  title={Contact process with exogenous infection and the scaled SIS process},
  author={June Zhang and Jos{\'e} M. F. Moura},
  journal={J. Complex Networks},
Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process with nonzero exogenous infection rate (also known as the {\epsilon}-SIS, {\epsilon} susceptible-infected-susceptible, model [1]). The only known analytical characterization of the equilibrium distribution of this process is for complete networks. For large… 

Figures and Tables from this paper

Estimating Parameters of Large CTMP from Single Trajectory with Application to Stochastic Network Epidemics Models

Stochastic GDS that are also continuous-time Markov processes (CTMP) are considered, whose transition rates are linear functions of some dynamics parameters $\theta$ of interest (i.e., healing, exogeneous, and endogeneous infection rates).

Who is More at Risk in Heterogenous Networks?

  • June ZhangJosé M. F. Moura
  • Computer Science
    2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2018
This work focuses on characterizing the vulnerability of thei\mathrm{th} individual in the network by studying the marginal probability of infection, P(x_{i}=1)$, of the scaled SIS process and describes the conditions for when degree distribution is a good indicator of how susceptible an individual is to infection.

Epidemic spreading of random walkers in metapopulation model on an alternating graph

Epidemic Spreading in Unidirectional Mobile Agents

We present an epidemic model combined with a traffic cellular automaton. Each agent or individual is either susceptible (S) or infected (I). An agent with a certain density moves to a fixed direction

Restricted migration of infected individuals in epidemic metapopulation model on double graphs

  • T. Nagatani
  • Mathematics
    Physica A: Statistical Mechanics and its Applications
  • 2019

Criticality in Spreading Processes without Timescale Separation and the Critical Brain Hypothesis

It is shown here that in a large class of relevant network topologies, the nature of the overall spreading fundamentally changes, and it is found that the transition between these exponents is governed by a competition between merging and propagation of activity, and an appropriate scaling relationship is identified for the transition point.

Beyond Herd Immunity Against Strategic Attackers

An analytical model is proposed which allows us to capture the impact of countermeasures against attackers when both endogenous as well as exogenous infections coexist, and shows that a diverse set of potential attacks produces non-trivial equilibria, some of which go counter to herd immunity.

Contaminação Epidêmica em Redes: Imunidade Coletiva e Suas Implicações Frente a Atacantes Estratégicos

Imunidade coletiva, um dos conceitos fundamentais associados à contaminações em redes, ocorre quando grande parte da população está imune a um ataque oriundo de uma classe de códigos maliciosos. A



Role of subgraphs in epidemics over finite-size networks under the scaled SIS process

It is proved that, for a range of epidemics parameters, this combinatorial problem leads to a submodular optimization problem, which is exactly solvable in polynomial time.

Accounting for topology in spreading contagion in non-complete networks

A continuous-time Markov chain infection model that explicitly accounts for the network topology, be it complete or non-complete, is offered and it is shown that network topologies have dramatic effect on the spread of infections.

Diffusion in Social Networks as SIS Epidemics: Beyond Full Mixing and Complete Graphs

The paper shows that interesting population asymptotic behaviors occur for scenarios where the individual tendencies of each agent oppose peer influences, and determines how the most probable configuration of agent states depends on both model parameters and network topology.

Threshold behavior of epidemics in regular networks

It is shown that for k-regular graph topologies, the most probable network state transitions from the state whereeveryone is healthy to one where everyone is infected at a threshold that depends on k but not on the size of the graph.

Epidemics in networks with nodal self-infection and the epidemic threshold.

An exact recursion relation for the Markov infinitesimal generator is presented and it is shown that for a certain range of small ε > 0, the in reality observed phase transition, also called the "metastable" state, that is characterized by the epidemic threshold is approximated.

Emergent behavior in large scale networks

It is shown that, under the heavy traffic assumption, the relevant underlying dynamics induces a coherent nontrivial metastable behavior in a macroscopic space-time scale: a slight imbalance on the effective spreading rate of one class over the others determines a significantly greater steady state predominance of this class overThe others, regardless of the initial distribution.

The effect of network topology on the spread of epidemics

  • A. GaneshL. MassouliéD. Towsley
  • Mathematics, Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.

Networks and epidemic models

A variety of methods are described that allow the mixing network, or an approximation to the network, to be ascertained and how the two fields of network theory and epidemiological modelling can deliver an improved understanding of disease dynamics and better public health through effective disease control are suggested.

Eight challenges for network epidemic models.

Dynamical Systems on Networks: A Tutorial

This tutorial should be helpful for junior and senior undergraduate students, graduate students, and researchers from mathematics, physics, and engineering who seek to study dynamical systems on networks but who may not have prior experience with graph theory or networks.