Capturing the drunk robber on a graph

zbMath1298.05224arXiv1305.4559MaRDI QIDQ406701

Natasha Komarov, Peter M. Winkler

Publication date: 9 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4559

zbMATH Keywords

random walkspursuit games on graphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Related Items (4)

General cops and robbers games with randomness ⋮ TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS ⋮ Selfish cops and passive robber: qualitative games ⋮ Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• A probabilistic approach to Carne's bound
• The capture time of a graph
• On the cop number of a graph
• Gibbs measures and dismantlable graphs
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Collisions Among Random Walks on a Graph
• Maximum hitting time for random walks on graphs
• Maximum diameter of regular digraphs
• Projective Planes
• On Cumulative Sums of Random Variables

This page was built for publication: Capturing the drunk robber on a graph