Exact computation for meeting times and infection times of random walks on graphs

DOI10.1186/s40736-015-0016-2zbMath1343.05140OpenAlexW1094055605WikidataQ59404070 ScholiaQ59404070MaRDI QIDQ740125

Takuya Ohwa

Publication date: 12 August 2016

Published in: Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s40736-015-0016-2

zbMATH Keywords

meeting timegraph productinfection timemultiple random walks

Mathematics Subject Classification ID

Epidemiology (92D30) Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items (1)

The end time of SIS epidemics driven by random walks on edge-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Meeting times of random walks on graphs
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• Meeting times for independent Markov chains
• On infection spreading and competition between independent random walks
• Multiple Random Walks in Random Regular Graphs
• CLT for the proportion of infected incividuals for an epidemic model on a complete graph
• Collisions Among Random Walks on a Graph
• Random walks on a complete graph: a model for infection

This page was built for publication: Exact computation for meeting times and infection times of random walks on graphs