Random walks on a complete graph: a model for infection
From MaRDI portal
Recommendations
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- CLT for the proportion of infected incividuals for an epidemic model on a complete graph
- Limit theorems for an epidemic model on the complete graph
- Viral processes by random walks on random regular graphs
- The contact process on the complete graph with random vertex-dependent infection rates
Cites work
- Collisions Among Random Walks on a Graph
- Coulomb systems at low density: a review.
- scientific article; zbMATH DE number 176640 (Why is no real title available?)
- scientific article; zbMATH DE number 3523369 (Why is no real title available?)
- scientific article; zbMATH DE number 1307590 (Why is no real title available?)
- scientific article; zbMATH DE number 1416163 (Why is no real title available?)
- Meeting times for independent Markov chains
Cited in
(7)- On infection spreading and competition between independent random walks
- Local survival of spread of infection among biased random walks
- Epidemic spreading of random walkers in metapopulation model on an alternating graph
- The end time of SIS epidemics driven by random walks on edge-transitive graphs
- Viral processes by random walks on random regular graphs
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Exact computation for meeting times and infection times of random walks on graphs
This page was built for publication: Random walks on a complete graph: a model for infection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660526)