Related papers: Uniform approximation of metrics by graphs

Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…

A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for…

The dimension of a graph $G$ is the smallest $d$ for which its vertices can be embedded in $d$-dimensional Euclidean space in the sense that the distances between endpoints of edges equal $1$ (but there may be other unit distances).…

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.

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…

A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…

We examine Euclidean plane domains with their hyperbolic or quasihyperbolic distance. We prove that the associated metric spaces are quasisymmetrically equivalent if and only if they are bi-Lipschitz equivalent. On the other hand, for…

We prove that the Gromov-Hausdorff distance from the circle with its geodesic metric to any simply connected geodesic space is never smaller than $\frac{\pi}{4}$. We also prove that this bound is tight through the construction of a simply…

For a proper, geodesic, Gromov hyperbolic metric space X, a discrete subgroup of isometries \Gamma whose limit set is uniformly perfect, and a disjoint collection of horoballs {H_j}, we show that the set of limit points badly approximable…

In Gromov's treatise Partial Differential Relations (volume 9 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 1986), a continuous map between Riemannian manifolds is called isometric if it preserves the length of rectifiable…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

In this paper, we prove that a metric measure space which has at least one open set isometric to an interval, and for which the (possibly non-unique) optimal transport map exists from any absolutely continuous measure to an arbitrary…

We prove uniform convergence of metrics $g_k$ on a closed surface with bounded integral curvature (measure) in the sense of A.D. Alexandrov, under the assumption that the curvature measures $\mathbb{K}_{g_k}=\mu^1_k-\mu^2_k$, where…

The paper is devoted to the study of the Gromov-Hausdorff proper class, consisting of all metric spaces considered up to isometry. In this class, a generalized Gromov-Hausdorff pseudometric is introduced and the geometry of the resulting…

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…

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

Author developed a uniform model for different spaces where distance and angle measure kinds are parameters. This model is calculus centric, but can also be used in theoretical research. It is useful in the following domains: deduction of…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

We prove that a self-homeomorphism of the Grushin plane is quasisymmetric if and only if it is metrically quasiconformal and if and only if it is geometrically quasiconformal. As the main step in our argument, we show that a quasisymmetric…