A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A gambler moves on the vertices 1, ..., n of a graph using the probability distribution p_1, ..., p_n. A cop pursues the gambler on the graph, only being able to move between adjacent vertices. What is the expected number of moves that the gambler can make until the cop catches them? Komarov and Winkler proved an upper bound of approximately 1.97n for the expected capture time on any connected n-vertex graph when the cop does not know the gambler's distribution. We improve this upper bound toarXiv:1701.01599v1 fatcat:vn56vvxkzrgmlcvbya4xhqglpu