Related papers: Metric Graph Approximations of Geodesic Spaces

In this paper, we first evaluate topological distributions of the sets of all doubling spaces, all uniformly disconnected spaces, and all uniformly perfect spaces in the space of all isometry classes of compact metric spaces equipped with…

The computation of distance measures between nodes in graphs is inefficient and does not scale to large graphs. We explore dense vector representations as an effective way to approximate the same information: we introduce a simple yet…

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.

Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…

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…

In this work, we propose to study the global geometrical properties of generative models. We introduce a new Riemannian metric to assess the similarity between any two data points. Importantly, our metric is agnostic to the parametrization…

We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…

The classical Reifenberg's theorem says that a set which is sufficiently well approximated by planes uniformly at all scales is a topological H\"older manifold. Remarkably, this generalizes to metric spaces, where the approximation by…

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…

A geodesic bicombing on a metric space selects for every pair of points a geodesic connecting them. We prove existence and uniqueness results for geodesic bicombings satisfying different convexity conditions. In combination with recent work…

An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…

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…

We study the asymptotics of the number N(t) of geometrically distinct closed geodesics of a Riemannian or Finsler metric on a connected sum of two compact manifolds of dimension at least three with non-trivial fundamental groups and apply…

Let $X$ be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume $X$ is not homothetic to a metric graph with integer edge lengths. Let $P_t$ be the number of parallel classes of…

The Reeb space, which generalizes the notion of a Reeb graph, is one of the few tools in topological data analysis and visualization suitable for the study of multivariate scientific datasets. First introduced by Edelsbrunner et al., it…

We investigate harmonic maps from weighted graphs into metric spaces that locally admit unique centers of gravity, like Alexandrov spaces with upper curvature bounds. We prove an existence result by constructing an iterative geometric…

We consider the Reeb graph of a thickening of points sampled from an unknown space. Our main contribution is a framework to transfer reconstruction results similar to the well-known work of Niyogi, Smale, and Weinberger to the setting of…

We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.