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

نویسندگان

  • E Cator
  • P Van Mieghem
چکیده

Since mean-field approximations for susceptible-infected-susceptible (SIS) epidemics do not always predict the correct scaling of the epidemic threshold of the SIS metastable regime, we propose two novel approaches: (a) an ε-SIS generalized model and (b) a modified SIS model that prevents the epidemic from dying out (i.e., without the complicating absorbing SIS state). Both adaptations of the SIS model feature a precisely defined steady state (that corresponds to the SIS metastable state) and allow an exact analysis in the complete and star graph consisting of a central node and N leaves. The N-intertwined mean-field approximation (NIMFA) is shown to be nearly exact for the complete graph but less accurate to predict the correct scaling of the epidemic threshold τ(c) in the star graph, which is found as τ(c)=ατ(c)((1)), where α=√[1/2 logN + 3/2 log logN] and where τ(c)((1))=1/√[N]<τ(c) is the first-order epidemic threshold for the star in NIMFA and equal to the inverse of the spectral radius of the star's adjacency matrix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 those graphs for which MFA is reasonably accurate. Here, we present an accuracy criterion for Markovian susceptible-infected-susceptible (SIS) epidemics on any network, based on the spectrum of the ...

متن کامل

Analysis of Exact and Approximated Epidemic Models over Complex Networks

We study the spread of discrete-time epidemics over arbitrary networks for well-known propagation models, namely SIS (susceptible-infected-susceptible), SIR (susceptible-infected-recovered), SIRS (susceptible-infected-recovered-susceptible) and SIV (susceptible-infected-vaccinated). Such epidemics are described by 2nor 3n-state Markov chains. Ostensibly, because analyzing such Markov chains is ...

متن کامل

The spreading time in SIS epidemics on networks

In a Susceptible–Infected–Susceptible (SIS) process, we investigate the spreading time Tm, which is the time when the number of infected nodes in the metastable state is first reached, starting from the outbreak of the epidemics. We observe that the spreading time Tm resembles a lognormal-like distribution, though with different deep tails, both for the Markovian and the non-Markovian infection...

متن کامل

Nodal infection in Markovian susceptible-infected-susceptible and susceptible-infected-removed epidemics on networks are non-negatively correlated.

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-...

متن کامل

Survival time of the susceptible-infected-susceptible infection process on a graph.

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-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 87 1  شماره 

صفحات  -

تاریخ انتشار 2013