Coarse cops and robber in graphs and groups

Abstract

(abstract shortened to meet arxiv's length requirements) We investigate two variants of the classical Cops and robber game in graphs, recently introduced by Lee, Martínez-Pedroza, and Rodríguez-Quinche. The two versions are played in infinite graphs and the goal of the cops is to prevent the robber to visit some ball of finite radius (chosen by the robber) infinitely many times. Moreover the cops and the robber move at a different speed, and the cops can choose a radius of capture before the game starts. Depending on the order in which the parameters are chosen, this naturally defines two games, a weak version and a strong version (in which the cops are more powerful), and thus two variants of the cop number of a graph $G$: the weak cop number and the strong cop number. It turns out that these two parameters are invariant under quasi-isometry and thus we can investigate these parameters in finitely generated groups by considering any of their Cayley graphs; the parameters do not depend on the chosen set of generators. We answer a number of questions raised by Lee, Martínez-Pedroza, and Rodríguez-Quinche, and more recently by Cornect and Martínez-Pedroza. This includes a proof that the weak and strong cop numbers are monotone under quasi-isometric embedding, characterizations of graphs of weak cop number 1 and graphs of strong cop number 1, and a proof that the grid has infinite strong cop number. Moreover we tie the weak cop number of a graph $G$ to the existence of asymptotic minors of large tree-width in $G$, and use the result to prove that any finitely presented group has weak cop number 1 or $\infty$. We have learned very recently that some of our results have been obtained independently by Appenzeller and Klinge, using fairly different arguments.