• Corpus ID: 14383059

Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold

  title={Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold},
  author={Piet Van Mieghem},
  journal={arXiv: Dynamical Systems},
  • P. V. Mieghem
  • Published 7 February 2014
  • Mathematics
  • arXiv: Dynamical Systems
Exploiting the power of the expectation operator and indicator (or Bernoulli) random variables, we present the exact governing equations for both the SIR and SIS epidemic models on \emph{networks}. Although SIR and SIS are basic epidemic models, deductions from their exact stochastic equations \textbf{without} making approximations (such as the common mean-field approximation) are scarce. An exact analytic solution of the governing equations is highly unlikely to be found (for any network) due… 

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

A formula for the epidemic threshold in the cycle (or ring graph) is presented and the challenge of finding tight upper bounds for the SIS (and SIR) epidemic threshold for all graphs is revisited.

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

Mean-field approximations (MFAs) are frequently used in physics. When a process (such as an epidemic or a synchronization) on a network is approximated by MFA, a major hurdle is the determination of

Power-law decay in epidemics is likely due to interactions with the time-variant contact graph

Reported COVID-19 data from o¢ cial health agencies in several countries suggest that the prevalence, the average fraction of infected people, decays over time with power-law tails. Moreover, the

Heterogeneous SIS model for directed networks and optimal immunization

This work investigates the influence of a contact network structure over the spread of epidemics in an heterogeneous population using a first-order mean-field approximation and proves that the positive steady-state of the original system, that appears above the threshold, can be computed by this lower-dimensional system.

Heterogeneous SIS model for directed networks and optimal curing policy

This work investigates the influence of the contact network structur e on the spread of epidemics over an heterogeneous population and proves that the epide mic threshold can be computed using a lower-dimensional dynamical system.

Universality of the SIS prevalence in networks

A new analysis of the prevalence, the expected number of infected nodes in a network, is presented and physically interpreted and leads to a universal, analytic curve, that can bound the time-varying prevalence in any finite time interval.

An Epidemic Perspective on the Cut Size in Networks

An epidemic spreads over the network via infectious links between healthy and infected nodes. The rate of increase in the number of infected nodes depends on the number of infectious links, called

Time to Extinction for the SIS Epidemic Model: New Bounds on the Tail Probabilities

  • Lorenzo Zino
  • Mathematics
    IEEE Transactions on Network Science and Engineering
  • 2019
It is proved that, for an effective infection rate above a threshold depending on the topology of the network, the time to extinction grows exponentially in the size of the population, with probability converging to 1 as the number of population grows large.

Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models

Under moderate assumptions on the reproduction number, it is proved that the infection numbers are bounded by supermodular functions in the D-Sir model and the IC-SIR model for large classes of random networks.



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.

Susceptible-infected-susceptible epidemics on the complete graph and the star graph: exact analysis.

Two novel approaches are proposed: an ε-SIS generalized model and a modified SIS model that prevents the epidemic from dying out (i.e., without the complicating absorbing SIS state).

Exact epidemic models on graphs using graph-automorphism driven lumping

A continuous time Markov chain is used to start from the exact formulation of a simple epidemic model on an arbitrary contact network and rigorously derive and prove some known results that were previously mainly justified based on some biological hypotheses.

Susceptible-infected-susceptible epidemics on networks with general infection and cure times.

The GSIS model is extended to incorporate infection and curing or recovery times each characterized by a general distribution, and it is shown that the average number of infection attempts during a recovery time is the more natural key parameter, instead of the effective infection rate.

Epidemic threshold for the susceptible-infectious-susceptible model on random networks.

An analytical expression for the critical infection rate r{c} of the susceptible-infectious-susceptible (SIS) disease spreading model on random networks is derived using percolation theory.

Spread of epidemic disease on networks.

  • M. Newman
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.

The N-intertwined SIS epidemic network model

The N-intertwined virus spread model of the SIS-type is introduced as a promising and analytically tractable model of which the steady-state behavior is fairly completely determined and much insight can be gained that is hidden in the exact Markov model.

Virus Spread in Networks

The influence of the network characteristics on the virus spread is analyzed in a new-the <i>N</i> -intertwined Markov chain-model, whose only approximation lies in the application of mean field

The Contact Process on Trees

The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter λ is varied. For small values of λ a single infection eventually dies

Absence of epidemic threshold in scale-free networks with degree correlations.

This work provides for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing.