6 citations · 6 across the 2 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Cops vs. Gambler
Natasha Komarov, Peter Winkler
We consider a variation of cop vs.\ robber on graph in which the robber is not restricted by the graph edges; instead, he picks a time-independent probability distribution on $V(G)…
math.CO2013
Capturing the Drunk Robber on a Graph
Natasha Komarov, Peter Winkler
We show that the expected time for a smart "cop" to catch a drunk "robber" on an -vertex graph is at most . More precisely, let be a simple, connected, undir…