English
Related papers

Related papers: Approximate Capture in Gromov-Hausdorff Closed Spa…

200 papers

We investigate the local structure of the space $\mathcal{M}$ consisting of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We consider finite metric spaces of the same cardinality and suppose that these…

Metric Geometry · Mathematics 2016-11-15 Alexander O. Ivanov , Alexey A. Tuzhilin

We study properties of metric segments in the class of all metric spaces considered up to an isometry, endowed with Gromov--Hausdorff distance. On the isometry classes of all compact metric spaces, the Gromov-Hausdorff distance is a metric.…

General Topology · Mathematics 2020-09-29 Olga Borisova

This paper presents a booby trap game played between a defender and an attacker on a search space, which may be a compact subset of Euclidean space or a network. The defender has several booby traps and chooses where to plant them. The…

Optimization and Control · Mathematics 2024-12-03 Thomas Lidbetter , Kyle Lin

In the present paper a distinguishability of bounded metric spaces by the set of the Gromov--Hausdorff distances to so-called simplexes (metric spaces with unique non-zero distance) is investigated. It is easy to construct an example of…

Metric Geometry · Mathematics 2024-12-30 A. O. Ivanov , E. S. Lychagina , A. A. Tuzhilin

The convex body chasing problem, introduced by Friedman and Linial, is a competitive analysis problem on any normed vector space. In convex body chasing, for each timestep $t\in\mathbb N$, a convex body $K_t\subseteq \mathbb R^d$ is given…

Data Structures and Algorithms · Computer Science 2021-08-16 Sébastien Bubeck , Bo'az Klartag , Yin Tat Lee , Yuanzhi Li , Mark Sellke

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

Differential Geometry · Mathematics 2022-11-09 Robin Neumayer

This paper studies a target-defense game played between a slow defender and a fast attacker. The attacker wins the game if it reaches the target while avoiding the defender's capture disk. The defender wins the game by preventing the…

Systems and Control · Electrical Eng. & Systems 2024-03-19 Goutam Das , Michael Dorothy , Zachary I. Bell , Daigo Shishika

We study locally compact, locally geodesically complete, locally CAT(k) spaces (GCBA(k)-spaces). We prove a Croke-type local volume estimate only depending on the dimension of these spaces. We show that a local doubling condition, with…

Metric Geometry · Mathematics 2021-02-16 Nicola Cavallucci , Andrea Sambusetti

In this paper we prove that every homeomorphism of a compact metric space admitting an invariant probability measure with full support can be approximated in the $C^0$-Gromov--Hausdorff topology by homeomorphisms with zero topological…

Dynamical Systems · Mathematics 2026-04-06 Richard Javier Cubas Becerra , Jorge Crisóstomo Parejas

We consider a game in which a cop searches for a moving robber on a graph using distance probes, studied by Carragher, Choi, Delcourt, Erickson and West, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt,…

Combinatorics · Mathematics 2020-08-12 John Haslegrave , Richard A. B. Johnson , Sebastian Koch

Although, in the task of grasping via a data-driven method, closed-loop feedback and predicting 6 degrees of freedom (DoF) grasp rather than conventionally used 4DoF top-down grasp are demonstrated to improve performance individually, few…

Robotics · Computer Science 2022-06-22 Dongwon Son

The recently introduced variation of the game of cops and robber is played on geodesic spaces. In this paper we establish some general strategies for the players, in particular the generalized radial strategy and the covering space…

Metric Geometry · Mathematics 2022-11-07 Vesna Iršič , Bojan Mohar , Alexandra Wesolek

Cops and robbers is a turn-based pursuit game played on a graph $G$. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number $c(G)$ denotes the minimum number of…

Combinatorics · Mathematics 2011-09-09 Andrew Beveridge , Andrzej Dudek , Alan Frieze , Tobias Müller

Hedonic games formalize coalition formation scenarios where players evaluate an outcome based on the coalition they are contained in. Due to a large number of possible coalitions, compact representations of these games are crucial. We…

Computer Science and Game Theory · Computer Science 2022-02-01 Anja Rey , Lisa Rey

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

$\newcommand{\eps}{\varepsilon} $We prove that for any $\eps > 0$ it is $\textsf{NP}$-hard to approximate the non-commutative Grothendieck problem to within a factor $1/2 + \eps$, which matches the approximation ratio of the algorithm of…

Computational Complexity · Computer Science 2022-02-22 Jop Briët , Oded Regev , Rishi Saket

Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…

Metric Geometry · Mathematics 2010-03-23 Rafa Espinola , Adriana Nicolae

In this paper we study connections between topological games such as Rothberger, Menger and compact-open, and relate these games to properties involving covers by G_{\delta} subsets. The results include: (1) If Two has a winning strategy in…

General Topology · Mathematics 2019-08-15 Leandro F. Aurichi , Rodrigo R. Dias

Graph-based transforms have been shown to be powerful tools in terms of image energy compaction. However, when the support increases to best capture signal dependencies, the computation of the basis functions becomes rapidly untractable.…

Computer Vision and Pattern Recognition · Computer Science 2020-02-19 Mira Rizkallah , Thomas Maugey , Christine Guillemot

In the classic game of Cops and Robbers, a team of cops pursues a robber through a graph. The traditional model of Cops and Robbers operates under the assumption that the cops know the robber's location at all times. Recently, however,…

Combinatorics · Mathematics 2025-09-08 John Jones , William B. Kinnersley
‹ Prev 1 8 9 10 Next ›