Cargando…
Viral Processes by Random Walks on Random Regular Graphs
We study the SIR epidemic model with infections carried by k particles making independent random walks on a random regular graph. We give a edge-weighted graph reduction of the dynamics of the process that allows us to apply standard results of Erdős–Renyi random graphs on the particle set. In parti...
Autores principales: | Abdullah, Mohammed, Cooper, Colin, Draief, Moez |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7122277/ http://dx.doi.org/10.1007/978-3-642-22935-0_30 |
Ejemplares similares
-
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
por: Draief, Moez, et al.
Publicado: (2010) -
Random Walk Approximation for Stochastic Processes on Graphs
por: Polizzi, Stefano, et al.
Publicado: (2023) -
Groups, graphs and random walks
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2017) -
The Impact of the Network Topology on the Viral Prevalence: A Node-Based Approach
por: Yang, Lu-Xing, et al.
Publicado: (2015) -
Influence of Random Walk Parametrization on Graph Embeddings
por: Schliski, Fabian, et al.
Publicado: (2020)