Related papers: Metric Graph Approximations of Geodesic Spaces
We show the equivalence of several characterizations of relative hyperbolicity for metric spaces, and obtain extra information about geodesics in a relatively hyperbolic space. We apply this to characterize hyperbolically embedded subgroups…
In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are…
Using the wedge sum of metric spaces, for all compact metrizable spaces, we construct a topological embedding of the compact metrizable space into the set of all metric trees in the Gromov--Hausdorff space with finite prescribed values. As…
Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The…
To investigate the topological structure of planar polygon decomposition on trapezoids, which is formed by height functions. We use the oriented Reeb graph of the function with a marked vertex. We describe all possible optimal Reeb graphs…
We investigate the geometry of the family $\cal M$ of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We show that sufficiently small neighborhoods of generic finite spaces in the subspace of all finite…
For an integer $k\geq 1$, the objective of \textsc{$k$-Geodesic Center} is to find a set $\mathcal{C}$ of $k$ isometric paths such that the maximum distance between any vertex $v$ and $\mathcal{C}$ is minimised. Introduced by Gromov,…
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…
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…
The Gromov-Hausdorff distance provides a metric on the set of isometry classes of compact metric spaces. Unfortunately, computing this metric directly is believed to be computationally intractable. Motivated by applications in shape…
We associate, with every infinite word over a finite alphabet, an increasing sequence of rooted finite graphs, which provide a discrete approximation of the famous Sierpi\'nski carpet fractal. Each of these sequences converges, in the…
We study properties of Sobolev-type metrics on the space of immersed plane curves. We show that the geodesic equation for Sobolev-type metrics with constant coefficients of order 2 and higher is globally well-posed for smooth initial data…
We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…
This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…