2020
DOI: 10.1007/s10955-020-02547-7
|View full text |Cite
|
Sign up to set email alerts
|

The End Time of SIS Epidemics Driven by Random Walks on Edge-Transitive Graphs

Abstract: Network epidemics is a ubiquitous model that can represent different phenomena and finds applications in various domains. Among its various characteristics, a fundamental question concerns the time when an epidemic stops propagating. We investigate this characteristic on a SIS epidemic induced by agents that move according to independent continuous time random walks on a finite graph: Agents can either be infected (I) or susceptible (S), and infection occurs when two agents with different epidemic states meet … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 31 publications
0
5
0
Order By: Relevance
“…Epidemics with motion were extensively studied in the random graph setting (without considering geometry). The basic model for SIS on graphs is that where agents perform a random walk on the random graph and where agents meeting at a give node of the graph may infect each other -see [5] and the references therein.…”
Section: The Sis Epidemic On Networkmentioning
confidence: 99%
“…Epidemics with motion were extensively studied in the random graph setting (without considering geometry). The basic model for SIS on graphs is that where agents perform a random walk on the random graph and where agents meeting at a give node of the graph may infect each other -see [5] and the references therein.…”
Section: The Sis Epidemic On Networkmentioning
confidence: 99%
“…The analysis of the case with mobility is more recent. The situation where agents perform a random walk on a finite graph and agents meeting at a given point of the graph may infect each other was studied in [6]. The situation where agents form a Poisson point process and migrate in the Euclidean plane was studied in [3], which proposed a computational framework based on moment closure techniques for evaluating the role of mobility in the propagation of epidemics.…”
Section: Introductionmentioning
confidence: 99%
“…The queueing model studied here may be seen as a discrete version of the model in [3], or as a thermodynamic limit of that of [6].
Figure 1. On the left, the SIS reactor.
…”
Section: Introductionmentioning
confidence: 99%
“…The analysis of the case with mobility is more recent. The situation where agents perform a random walk on a finite graph and agents meeting at a given point of the graph may infect each other was studied in [5]. The situation where agents form a Poisson point processes and migrate in the Euclidean plane was studied in [2], were a computational framework based onmoment closure techniques was proposed for evaluating the role of mobility on the propagation of epidemics.…”
Section: Introductionmentioning
confidence: 99%
“…The queuing model studied here may be seen as a discrete version of the model in of [2], or as a thermodynamic limit of that of [5].…”
Section: Introductionmentioning
confidence: 99%