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

DOI10.1186/S40736-015-0016-2zbMATH Open1343.05140OpenAlexW1094055605WikidataQ59404070 ScholiaQ59404070MaRDI QIDQ740125FDOQ740125

Authors: 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

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

zbMATH Keywords

meeting timegraph productinfection timemultiple random walks

Mathematics Subject Classification ID

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

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Limit theorems for an epidemic model on the complete graph
• Meeting times for independent Markov chains
• Meeting times of random walks on graphs
• Multiple random walks in random regular graphs
• Collisions Among Random Walks on a Graph
• On infection spreading and competition between independent random walks
• CLT for the proportion of infected incividuals for an epidemic model on a complete graph
• 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

Cited In (6)

• A cops and robber game and the meeting time of synchronous directed walks
• Meeting times of random walks on graphs
• 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)