相关论文: The Gromov--Hausdorff Distance between Simplexes a…

As a valid metric of metric-measure spaces, Gromov-Wasserstein (GW) distance has shown the potential for matching problems of structured data like point clouds and graphs. However, its application in practice is limited due to the high…

We have constructed a realization of rectilinear geodesic (in the sense of~\cite{Memoli2018}), lying in Gromov-Hausdorff space, as a shortest geodesic w.r.t. the Hausdorff distance in an ambient metric space.

The magnitude of metric spaces does not appear to possess a simple, convenient continuity property, and previous studies have presented affirmative results under additional constraints or weaker notions, as well as counterexamples. In this…

We prove that every quasisphere is the Gromov-Hausdorff limit of a sequence of locally smooth uniform quasispheres. We also prove an analogous result in the bi-Lipschitz setting. This extends recent results of D. Ntalampekos from dimension…

The present paper generalizes the result from one of the papers by Galstyan. Namely, we consider two nonempty subsets $A$ and $B$ of a metric space $X$, and construct one-parametric family $F_r$ of subsets obtained by intersection between…

What is the analogous notion of Gromov-Hausdorff convergence for sequences of spacetimes? Since a Lorentzian manifold is not inherently a metric space, one cannot simply use the traditional definition. One approach offered by Sormani and…

The Gromov-Wasserstein (GW) distance is frequently used in machine learning to compare distributions across distinct metric spaces. Despite its utility, it remains computationally intensive, especially for large-scale problems. Recently, a…

For non-empty sets X we define notions of distance and pseudo metric with values in a partially ordered set that has a smallest element $\theta $. If $h_X$ is a distance in $X$ (respectively, a pseudo metric in $X$), then the pair $(X,h_X)$…

In this paper we propose formulas for the distance between vertices of a generalized Sierpi\'{n}ski graph $S(G,t)$ in terms of the distance between vertices of the base graph $G$. In particular, we deduce a recursive formula for the…

The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the…

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…

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…

We give a new proof of the Gromov theorem: For any $C>0$ and integer $n>1$ there exists a function $\Delta_{C,n}$ such that if the Gromov--Hausdorff distance between complete Riemannian $n$-manifolds $V$ and $W$ is not greater than…

This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…

A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…

This paper presents a framework for computing the Gromov-Wasserstein problem between two sets of points in low dimensional spaces, where the discrepancy is the squared Euclidean norm. The Gromov-Wasserstein problem is a generalization of…

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…

The Reeb graph is a construction that studies a topological space through the lens of a real valued function. It has widely been used in applications, however its use on real data means that it is desirable and increasingly necessary to…

Sakovich--Sormani introduced several notions of distance between certain classes of Lorentzian manifolds. These distances use the Hausdorff and Gromov-Hausdorff distances and therefore extend naturally to a broader class of spaces. Here we…

In this paper we introduce a pruning of the medial axis called the $(\lambda,\alpha)$-medial axis ($\textrm{ax}_\lambda^\alpha $). We prove that the $(\lambda,\alpha)$-medial axis of a set $K$ is stable in a Gromov-Hausdorff sense under…