Related papers: Positive Alexander Duality for Pursuit and Evasion

This paper studies a two-player game with a quantitative surveillance requirement on an adversarial target moving in a discrete state space and a secondary objective to maximize short-term visibility of the environment. We impose the…

General physical background of Peres-Horodecki positive partial transpose (ppt-) separability criterion is revealed. Especially, the physical sense of partial transpose operation is shown to be equivalent to the "local causality reversal"…

In this paper we define the coarse (co)homology of the complement of a subspace in a metric space, generalizing the coarse (co)homology of Roe. We give a model space which encodes coarse geometric structure of the complement. We also…

The interdiction of escaping adversaries in urban networks is a critical security challenge. State-of-the-art game-theoretic models, such as the Escape Interdiction Game (EIG), provide comprehensive frameworks but assume a highly dynamic…

We present a framework that incorporates the idea of bounded rationality into dynamic stochastic pursuit-evasion games. The solution of a stochastic game is characterized, in general, by its (Nash) equilibria in feedback form. However,…

In this paper we elaborate a general homotopy-theoretic framework in which to study problems of descent and completion and of their duals, codescent and cocompletion. Our approach to homotopic (co)descent and to derived (co)completion can…

The Peres-Horodecki criterion of positivity under partial transpose is studied in the context of separability of bipartite continuous variable states. The partial transpose operation admits, in the continuous case, a geometric…

We provide a rearrangement based algorithm for fast detection of subgraphs of $k$ vertices with long escape times for directed or undirected networks. Complementing other notions of densest subgraphs and graph cuts, our method is based on…

We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…

We model problems as presheaves that assign sets of certificates to input instances, and we show how to use presheaf \v{C}ech cohomology to capture the precise ways in which local solutions fail to patch into global ones. Applied to…

In this paper, we consider pursuit-evasion and probabilistic consequences of some geometric notions for bounded and suitably regular domains in Euclidean space that are CAT(kappa) for some kappa > 0. These geometric notions are useful for…

We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding locations to find multiple items hidden by a hider. Each hiding location has a maximum hiding capacity and a probability of detecting its hidden…

A general method for establishing results over a commutative complete intersection local ring by passing to differential graded modules over a graded exterior algebra is described. It is used to deduce, in a uniform way, results on the…

We consider a class of pursuit-evasion differential games in which the evader has continuous access to the pursuer's location, but not vice-versa. There is a remote sensor (e.g., a radar station) that can sense the evader's location upon a…

Chase-like decoding algorithms are a popular choice for soft-input decoding of algebraic codes. In this paper, we evaluate the performance of different test pattern sets using three methods. For test pattern sets with a certain structure…

We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We…

Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive. They are related to posets and have applications in scheduling theory. This paper considers the problem of…

Persistent homology is used to track the appearance and disappearance of features as we move through a nested sequence of topological spaces. Equating the nested sequence to a filtration and the appearance and disappearance of features to…

We formulate a stochastic zero-sum game over continuous-time dynamics to analyze the competition between the attacker, who tries to covertly misguide the vehicle to an unsafe region, versus the detector, who tries to detect the attack…

The security in networked systems depends greatly on recognizing and identifying adversarial behaviors. Traditional detection methods focus on specific categories of attacks and have become inadequate for increasingly stealthy and deceptive…