Related papers: Metric Graph Approximations of Geodesic Spaces
We consider the fundamental task of optimising a real-valued function defined in a potentially high-dimensional Euclidean space, such as the loss function in many machine-learning tasks or the logarithm of the probability distribution in…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
We consider the space of probability measures on a discrete set $X$, endowed with a dynamical optimal transport metric. Given two probability measures supported in a subset $Y \subseteq X$, it is natural to ask whether they can be connected…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
We introduce a hypertopology, induced by an inframetric up to full quantum isometry, on the class of pointed proper quantum metric spaces, which are separable, possibly non-unital, C*-algebras endowed with an analogue of the Lipschitz…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
We first prove a version of Tietze-Urysohn's theorem for proper functions taking values in non-negative real numbers defined on $\sigma$-compact locally compact Hausdorff spaces. As its application, we prove an extension theorem of proper…
We show that an isometric action of a torsion-free uniform lattice $\Gamma$ on hyperbolic space $\mathbb{H}^n$ can be metrically approximated by geometric actions of $\Gamma$ on $\mathrm{CAT}(0)$ cube complexes, provided that either $n$ is…
Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…
Let X be a finite 2-complex with unfree fundamental group. We prove lower bounds for the area of a metric on X, in terms of the square of the least length of a noncontractible loop in X. We thus establish a uniform systolic inequality for…
Let $\Sigma$ be a closed hyperbolic surface. We study, for fixed $g$, the asymptotics of the number of those periodic geodesics in $\Sigma$ having at most length $L$ and which can be written as the product of $g$ commutators. The basic idea…
By a geodesic subspace of a metric space $X$ we mean a subset $A$ of $X$ such that any two points in $A$ can be connected by a geodesic in $A$. It is easy to check that a geodesic metric space $X$ is an $\mathbb{R}$-tree (that is, a…
We demonstrate that a graph-based search algorithm-relying on the construction of an approximate neighborhood graph-can directly work with challenging non-metric and/or non-symmetric distances without resorting to metric-space mapping…
Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…
We survey some recent results and open questions on the approaching geodesics property and its application to the study of the Gromov and horofunction compactifications of a proper geodesic Gromov metric space. We obtain results on the…
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
We provide relationships between the spectral convergences in B\'erard-Besson-Gallot sense, in Kasue-Kumura sense and the measured Gromov-Hausdorff convergence, for compact finite dimensional RCD spaces. As an independent interest, a…
Geodesic distance, commonly called shortest path length, has proved useful in a great variety of disciplines. It has been playing a significant role in search engine at present and so attracted considerable attention at the last few…