Related papers: The Gromov-Wasserstein distance between spheres
The Gromov-Hausdorff distance between two metric spaces measures how far the spaces are from being isometric. It has played an important and longstanding role in geometry and shape comparison. More recently, it has been discovered that the…
We provide general upper and lower bounds for the Gromov-Hausdorff distance $d_{\mathrm{GH}}(\mathbb{S}^m,\mathbb{S}^n)$ between spheres $\mathbb{S}^m$ and $\mathbb{S}^n$ (endowed with the round metric) for $0\leq m< n\leq \infty$. Some of…
The Gromov-Hausdorff distance $(d_{GH})$ proves to be a useful distance measure between shapes. In order to approximate $d_{GH}$ for compact subsets $X,Y\subset\mathbb{R}^d$, we look into its relationship with $d_{H,iso}$, the infimum…
The Gromov-Wasserstein (GW) distance is a powerful tool for comparing metric measure spaces which has found broad applications in data science and machine learning. Driven by the need to analyze datasets whose objects have increasingly…
In this paper, we investigate compact ultrametric measure spaces which form a subset $\mathcal{U}^w$ of the collection of all metric measure spaces $\mathcal{M}^w$. Similar as for the ultrametric Gromov-Hausdorff distance on the collection…
In this article, as a first contribution, we provide alternative proofs of recent results by Harrison and Jeffs which determine the precise value of the Gromov-Hausdorff (GH) distance between the circle $\mathbb{S}^1$ and the…
The Hausdorff distance measures how far apart two sets are in a common metric space. By contrast, the Gromov-Hausdorff distance provides a notion of distance between two abstract metric spaces. How do these distances behave for quotients of…
We calculate the Gromov-Hausdorff distance between vertex sets of regular polygons endowed with the round metric. We give a full answer for the case of n- and m-gons with m divisible by n. Also, we calculate all distances to 2-gons and…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
In the study of dynamical and physical systems, the input parameters are often uncertain or randomly distributed according to a measure $\varrho$. The system's response $f$ pushes forward $\varrho$ to a new measure $f\circ \varrho$ which we…
We calculate the Gromov--Hausdorff distance between a line segment and a circle in the Euclidean plane. To do that, we introduced a few new notions like round spaces and nonlinearity degree of a metric space.
The Gromov-Wasserstein (GW) distance has gained increasing interest in the machine learning community in recent years, as it allows for the comparison of measures in different metric spaces. To overcome the limitations imposed by the equal…
The Gromov-Hausdorff distance ($d_\mathrm{GH}$) provides a natural way of quantifying the dissimilarity between two given metric spaces. It is known that computing $d_\mathrm{GH}$ between two finite metric spaces is NP-hard, even in the…
Inspired by the Kantorovich formulation of optimal transport distance between probability measures on a metric space, Gromov-Wasserstein (GW) distances comprise a family of metrics on the space of isomorphism classes of metric measure…
The Gromov-Wasserstein distances were proposed a few years ago to compare distributions which do not lie in the same space. In particular, they offer an interesting alternative to the Wasserstein distances for comparing probability measures…
The Gromov-Wasserstein (GW) framework adapts ideas from optimal transport to allow for the comparison of probability distributions defined on different metric spaces. Scalable computation of GW distances and associated matchings on graphs…
This paper studies $l^p$-products of metric spaces and provides estimates for the Gromov-Hausdorff distances between them. The case of linear products is considered separately, and sufficient conditions for attainability of the estimates…
In the present paper we calculate the Gromov-Hausdorff distance between an arbitrary simplex (a metric space all whose non-zero distances are the same) and a finite metric space whose non-zero distances take two distinct values (so-called…
For each arbitrary finite group $G$, we consider a suitable notion of Gromov Hausdorff distance between compact $G$ metric spaces and derive lower bounds based on equivariant topology methods. As applications, we prove equivariant rigidity…
The Gromov-Hausdorff distance measures the similarity between two metric spaces by isometrically embedding them into an ambient metric space. We introduce an analogue of this distance for metric spaces endowed with directed structures. The…