Exact computation for meeting times and infection times of random walks on graphs
From MaRDI portal
(Redirected from Publication:740125)
Recommendations
- Meeting times of random walks on graphs
- The infection time of graphs
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Random walks on a complete graph: a model for infection
- Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
Cites work
- 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
- Collisions Among Random Walks on a Graph
- Limit theorems for an epidemic model on the complete graph
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Meeting times for independent Markov chains
- Meeting times of random walks on graphs
- Multiple random walks in random regular graphs
- On infection spreading and competition between independent random walks
- Random walks on a complete graph: a model for infection
Cited in
(6)- Meeting times of random walks on graphs
- A cops and robber game and the meeting time of synchronous directed walks
- Multiple lazy random walks on cycles
- The infection time of graphs
- Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
- The end time of SIS epidemics driven by random walks on edge-transitive graphs
This page was built for publication: Exact computation for meeting times and infection times of random walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740125)