Related papers: Metric stability of trees and tight spans
In this paper, we consider circulant graphs obtained from the complete graph $K_N$ by deleting all edges belonging to a prescribed distance class. We study, in a unified manner, the effective resistance, the expected hitting time, the…
We relate $L^p$ convergence of metric tensors or volume convergence to a given smooth metric to Intrinsic Flat and Gromov-Hausdorff convergence for sequences of Riemannian manifolds. We present many examples of sequences of conformal…
It is shown that each finite family of finite metric spaces, being considered as a subset of Gromov--Hausdorff space, can be connected by a Steiner minimal tree.
Recent studies propose enhancing machine learning models by aligning the geometric characteristics of the latent space with the underlying data structure. Instead of relying solely on Euclidean space, researchers have suggested using…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
We show that a geodesic metric space is hyperbolic in the sense of Gromov if and only if intersections of balls have bounded eccentricity. In particular, $\R$-trees are characterized among geodesic metric spaces by the property that the…
We first prove that for all compact metrizable spaces, there exists a topological embedding of the compact metrizable space into each of the sets of compact metric spaces which are connected, path-connected, geodesic, or CAT(0), in the…
The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between metric spaces. It is defined as the minimal distortion of embedding one surface into the other, while the optimal correspondence can be described as…
Reeb graphs are a fundamental structure for analyzing the topological and geometric properties of scalar fields. Comparing Reeb graphs is crucial for advancing research in this domain, yet existing metrics are often computationally…
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…
We present a new general framework for metrization of Gromov-Hausdorff-type topologies on non-compact metric spaces. We also give easy-to-check conditions for separability and completeness and hence the measure theoretic requirements are…
Comparing metric measure spaces (i.e. a metric space endowed with aprobability distribution) is at the heart of many machine learning problems. The most popular distance between such metric measure spaces is theGromov-Wasserstein (GW)…
We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem. Then we propose a novel distance between two graphs, named…
This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
The paper is devoted to the study of Gromov-Hausdorff convergence and stability of irreversible metric-measure spaces, both in the compact and noncompact cases. While the compact setting is mostly similar to the reversible case developed by…
We introduce a class of random compact metric spaces L(\alpha) indexed by \alpha \in (1,2) and which we call stable looptrees. They are made of a collection of random loops glued together along a tree structure, and can be informally be…
Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit…
This short note introduces the harmonic indel distance (HID), a new distance between strings where the cost of an insertion or deletion is inversely proportional to the string length. We present a closed-form formula and show that the HID…
Let $M$ be a compact Riemannian manifold with boundary. We show that $M$ is Gromov-Hausdorff close to a convex Euclidean region $D$ of the same dimension if the boundary distance function of $M$ is $C^1$-close to that of $D$. More…