Related papers: Metric stability of trees and tight spans
We show that the problem whether a given finite metric space can be embedded into $m$-dimensional rectilinear space can be reformulated in terms of the Gromov--Hausdorff distance between some special finite metric spaces.
In the present paper a distinguishability of bounded metric spaces by the set of the Gromov--Hausdorff distances to so-called simplexes (metric spaces with unique non-zero distance) is investigated. It is easy to construct an example of…
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-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…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…
The course was given at Peking University, Fall 2019. We discuss the following subjects: (1) Introduction to general topology, hyperspaces, metric and pseudometric spaces, graph theory. (2) Graphs in metric spaces, minimum spanning tree,…
In this paper, we consider a fixed metric space (possibly an oriented Riemannian manifold with boundary) with an increasing sequence of distance functions and a uniform upper bound on diameter. When the metric space endowed with the…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
The paper studies the class of all metric spaces considered up to zero Gromov-Hausdorff distance between them. In this class, we examine clouds - classes of spaces situated at finite Gromov-Hausdorff distances from a reference space. We…
Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological…
Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. Much of the previous…
In this work, a metric is presented on the set of boundedly-compact pointed metric spaces that generates the Gromov-Hausdorff topology. A similar metric is defined for measured metric spaces that generates the Gromov-Hausdorff-Prokhorov…
In the present paper we investigate the metric space $\cal M$ consisting of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We show that for any finite subset $M$ from a sufficiently small neighborhood…
For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…
We present a new class of metrics for unrooted phylogenetic $X$-trees derived from the Gromov-Hausdorff distance for (compact) metric spaces. These metrics can be efficiently computed by linear or quadratic programming. They are robust…
This paper introduces decorated merge trees (DMTs) as a novel invariant for persistent spaces. DMTs combine both $\pi_0$ and $H_n$ information into a single data structure that distinguishes filtrations that merge trees and persistent…
Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it…
In this paper, we study the Gromov-Hausdorff stability and continuous dependence of the inertial manifolds under perturbations of the domain and equation. More precisely, we use the Gromov-Hausdorff distances between two inertial manifolds…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…