相关论文: The Gromov--Hausdorff Distance between Simplexes a…
We consider generalized metric spaces taking distances in an arbitrary ordered commutative monoid, and investigate when a class $\mathcal{K}$ of finite generalized metric spaces satisfies the Hrushovski extension property: for any…
We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$…
Inspired by regularization in quantum field theory, we study topological and metric properties of spaces in which a cut-off is introduced. We work in the framework of noncommutative geometry, and focus on Connes distance associated to a…
The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…
Pairwise comparison of graphs is key to many applications in Machine learning ranging from clustering, kernel-based classification/regression and more recently supervised graph prediction. Distances between graphs usually rely on…
In this paper we compute the Hausdorff distance between sets of continuous curves and sets of piecewise constant or linear discretizations. These sets are Sobolev balls given by the continuous or discrete $L^p$-norm of the derivatives. We…
The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…
Any discrete approach to quantum gravity must provide some prescription as to how to deduce continuum properties from the discrete substructure. In the causal set approach it is straightforward to deduce timelike distances, but surprisingly…
In this note, we prove optimal extension results for roughly isometric relations between metric (R-)trees and injective metric spaces. This yields sharp stability estimates, in terms of the Gromov-Hausdorff (GH) distance, for certain metric…
We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
In this paper, we study the stability of the q-hyperconvex hull of a quasi-metric space, adapting known results for the hyperconvex hull of a metric space. To pursue this goal, we extend well-known metric notions, such as Gromov-Hausdorff…
In a previous paper, we studied the connection between points in $\mathbb{H}^n$ and $2$-dimensional rigid adelic spaces on a totally real number field $K$ with class number $h_K = 1$. This last assumption was needed to link heights and…
We define and study a class of graphs, called 2-stab interval graphs (2SIG), with boxicity 2 which properly contains the class of interval graphs. A 2SIG is an axes-parallel rectangle intersection graph where the rectangles have unit height…
In this paper, we give a generalisation of Gromov's compactness theorem for metric spaces, more precisely, we give a compactness theorem for the space of distance measure spaces equipped with a \emph{generalised…
In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {\mathbb R}^n $, i.e., graphs such that their vertices are…
We introduce the notion of causally-null-compactifiable space-times which can be canonically converted into a compact timed-metric-spaces using the cosmological time of Andersson-Howard-Galloway and the null distance of Sormani-Vega. We…
The Hausdorff distance is a metric commonly used to compute the set similarity of geometric sets. For sets containing a total of $n$ points, the exact distance can be computed na\"{i}vely in $O(n^2)$ time. In this paper, we show how to…
Geodesics are used in a wide array of applications in cosmology and astrophysics. However, it is not a trivial task to efficiently calculate exact geodesic distances in an arbitrary spacetime. We show that in spatially flat…
We construct an isometric embedding of a bounded set in a Euclidean space into the Gromov-Hausdorff space. In particular, we can embed a bounded and connected Riemannian manifold into the Gromov-Hausdorff space by a bilipschitz map.