Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 56 tok/s
Gemini 2.5 Pro 39 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 155 tok/s Pro
GPT OSS 120B 476 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Universality of the SIS prevalence in networks (1612.01386v1)

Published 5 Dec 2016 in physics.soc-ph, cs.SI, and q-bio.PE

Abstract: Epidemic models are increasingly used in real-world networks to understand diffusion phenomena (such as the spread of diseases, emotions, innovations, failures) or the transport of information (such as news, memes in social on-line networks). A new analysis of the prevalence, the expected number of infected nodes in a network, is presented and physically interpreted. The analysis method is based on spectral decomposition and leads to a universal, analytic curve, that can bound the time-varying prevalence in any finite time interval. Moreover, that universal curve also applies to various types of Susceptible-Infected-Susceptible (SIS) (and Susceptible-Infected-Removed (SIR)) infection processes, with both homogenous and heterogeneous infection characteristics (curing and infection rates), in temporal and even disconnected graphs and in SIS processes with and without self-infections. The accuracy of the universal curve is comparable to that of well-established mean-field approximations.

Citations (17)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)