Graphs measure interactions between objects such as friendship links on Twitter,
transactions between Bitcoin users, and the flow of energy in a food chain. While graphs …

We present analytic results for mean capture time and energy expended by a pack of
deterministic hounds actively chasing a randomly diffusing prey. Depending on the number …

Graph Searching Games and Probabilistic Methods is the first book that focuses on the
intersection of graph searching games and probabilistic methods. The book explores …

We consider a variation of the Cops and Robber game where the cops can only see the
robber when the distance between them is at most a fixed parameter ℓ. We consider the …

We consider a variant of the pursuit–evasion game Cops and Robber, called Zombies and
Survivors. The zombies, being of limited intelligence, have a very simple objective at each …

We survey results at the intersection of topological graph theory and the game of Cops and
Robbers, focusing on results, conjectures, and open problems for the cop number of a graph …

Zombies and Survivor is a variant of the well-studied game of Cops and Robbers where the
zombies (cops) can only move closer to the survivor (robber). We consider the deterministic …

We study zombies and survivor, a variant of the game of cops and robber on graphs. In this
variant, the single survivor plays the role of the robber and attempts to escape from the …

We introduce and study quantized versions of Cop and Robber game. We achieve this by
using graph-preserving quantum operations, which are the quantum analogues of stochastic …

In many variants of the game of Cops and Robbers on graphs, multiple cops play against a
single robber. In 2019, Cox and Sanaei introduced a variant of the game that gives the …