Related papers: Uniform approximation of metrics by graphs

In this note we show that given two complete geodesic Gromov hyperbolic spaces that are roughly isometric and $\varepsilon>0$, either the uniformization of both spaces with parameter $\varepsilon$ results in uniform domains, or else neither…

We construct an isometric embedding of a bounded set in a Euclidean space into the Gromov-Hausdorff space. In particular, we can embed a bounded and connected Riemannian manifold into the Gromov-Hausdorff space by a bilipschitz map.

It is proved that the Gromov-Hausdorff metric on the space of compact metric spaces considered up to an isometry is strictly intrinsic, i.e., the corresponding metric space is geodesic. In other words, each two points of this space (each…

This paper is about similarity between objects that can be represented as points in metric measure spaces. A metric measure space is a metric space that is also equipped with a measure. For example, a network with distances between its…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in…

Given metric quotients $S$ and $S_n$, $n \in \mathbb{N}$, of a metric space $X$, sufficient conditions are provided on the data defining them guaranteeing that $S$ is the Gromov-Hausdorff limit of $S_n$. These conditions are recognized…

We introduce the concept of boundary rigidity for Gromov hyperbolic spaces. We show that a proper geodesic Gromov hyperbolic space with a pole is boundary rigid if and only if its Gromov boundary is uniformly perfect. As an application, we…

We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.

We define a distance analogous to the Gromov-Hausdorff distance that enables the comparison of arbitrary quasi-isometric spaces. We also investigate properties preserved under limits with respect to this distance, as well as properties of…

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

We develop a matricial version of Rieffel's Gromov-Hausdorff distance for compact quantum metric spaces within the setting of operator systems and unital C*-algebras. Our approach yields a metric space of ``isometric'' unital complete order…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

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…

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean…

We prove that a proper geodesic metric space has non-positive curvature in the sense of Alexandrov if and only if it satisfies the Euclidean isoperimetric inequality for curves. Our result extends to non-geodesic spaces and non-zero…

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…

We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…