Distributed pursuit algorithms for probabilistic adversaries on connected graphs

Jesse Geneson

A gambler moves between the vertices $1,\dots ,n$ of a graph using the probability distribution $p_1,\dots ,p_n$. Multiple cops pursue the gambler on the graph, only being…