Related papers: Cop and robber on finite spaces

We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and…

We introduce the bodyguard problem for graphs. This is a variation of Surrounding Cops and Robber but, in this model, a smallest possible group of bodyguards must surround the president and then maintain this protection indefinitely. We…

We study the localization game on dense random graphs. In this game, a {\em cop} $x$ tries to locate a {\em robber} $y$ by asking for the graph distance of $y$ from every vertex in a sequence of sets $W_1,W_2,\ldots,W_\ell$. We prove high…

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 robber a more active role than simply evading the cop. In their…

We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…

We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer…

In this paper, we study different variants of the Cops-and-Robber game with respect to cop- and robber\-/monotonicity. We study a visible and invisible robber and variants where the robber is lazy, thus can only move when the cops announce…

In this paper, we investigate topological modes of different physical systems defined on arbitrary two-dimensional curved surfaces. We consider the shallow water equations, inhomogeneous Maxwell's equations, Jackiw-Rebbi model and show how…

In this paper we analyze a variant of the pursuit-evasion game on a graph $G$ where the intruder occupies a vertex, is allowed to move to adjacent vertices or remain in place, and is 'invisible' to the searcher, meaning that the searcher…

The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the location of the robber. We present a novel graph parameter called…

We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Omega(d^t). By the known upper bounds on the…

A test space is the set of outcome-sets associated with a collection of experiments. This notion provides a simple mathematical framework for the study of probabilistic theories -- notably, quantum mechanics -- in which one is faced with…

In the game of \emph{cops and robbers} on a graph $G = (V,E)$, $k$ cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the robber's turn, he moves similarly. The cops win if there is…

It is shown that a surjective monotone map $X\to Y$ between finite $T_0$-spaces induces a surjective map on homology. As such a map turns out to be a sequence of edge contractions in the Hasse diagram of $X$, followed by a homeomorphism,…

In this paper, we give a topological version of Scott convergence theorem for locally hypercompact spaces. We introduce the notion of $\mathcal{S}^*_X$-convergence on a $T_0$ topological space $X$, and define the notion of finitely…

The traditional game of cops and robbers is played on undirected graph. Recently, the same game played on directed graph is getting attention by more and more people. We knew that if we forbid some subgraph we can bound the cop number of…

The cops-and-robber (CR) game has been used in mobile robotics as a discretized model (played on a graph G) of pursuit/evasion problems. The "classic" CR version is a perfect information game: the cops' (pursuer's) location is always known…

A topology on a nonempty set $X$ specifies a natural subset of $\mathcal{P}(X)$. By identifying $\mathcal{P}(\mathcal{P}(X))$ with the totally disconnected compact Hausdorff space $2^{\mathcal{P}(X)}$, the lattice $Top(X)$ of all topologies…

Loops are pervasive in robotics problems, appearing in mapping and localization, where one is interested in finding loop closure constraints to better approximate robot poses or other estimated quantities, as well as planning and…

For a metrizable space $X$ of density $\kappa$, let $PM(X)$ be the space of continuous bounded pseudometrics on $X$ endowed with the uniform convergence topology. In this paper, its topology shall be classified as follows: (i) If $X$ is…