Related papers: On the Gromov-Prohorov distance
This is the first of two works concerning the Sobolev calculus on metric measure spaces and its applications. In this work, we focus on several notions of metric Sobolev space and on their equivalence. More precisely, we give a systematic…
In this paper, we apply the concept of asymptotic dimension to calculating Gromov-Hausdorff distances between some unbounded metric spaces. For example, we show that the Gromov--Hausdorff between $\mathbb{R}^2$ with the Euclidean metric and…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone $\cal R$ of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance…
We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…
This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N…
In this book, we study Gromov's metric geometric theory on the space of metric measure spaces, based on the idea of concentration of measure phenomenon due to L\'evy and Milman. Although most of the details are omitted in the original…
If one thinks of a Riemannian metric, $g_1$, analogously as the gradient of the corresponding distance function, $d_1$, with respect to a background Riemannian metric, $g_0$, then a natural question arises as to whether a corresponding…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
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 consider the metric transformation of metric measure spaces/pyramids. We clarify the conditions to obtain the convergence of the sequence of transformed spaces from that of the original sequence, and, conversely, to obtain the…
We provide general upper and lower bounds for the Gromov-Hausdorff distance $d_{\mathrm{GH}}(\mathbb{S}^m,\mathbb{S}^n)$ between spheres $\mathbb{S}^m$ and $\mathbb{S}^n$ (endowed with the round metric) for $0\leq m< n\leq \infty$. Some of…
The paper is devoted to geometrical investigation of the Gromov-Hausdorff distance on the classes of all metric spaces and of all bounded metric spaces. The main attention is paid to pass connectivity questions. The pass connected…
We introduce a general framework for analyzing data modeled as parameterized families of networks. Building on a Gromov-Wasserstein variant of optimal transport, we define a family of parameterized Gromov-Wasserstein distances for comparing…
In this note we prove that on general metric measure spaces the perimeter is equal to the relaxation of the Minkowski content w.r.t.\ convergence in measure
Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…
In this paper, the concept of the classical $f$-divergence for a pair of measures is extended to the mixed $f$-divergence for multiple pairs of measures. The mixed $f$-divergence provides a way to measure the difference between multiple…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We introduce a new distance, a Lipschitz-Prokhorov distance $d_{LP}$, on the set $\mathcal {PM}$ of isomorphism classes of pairs $(X, P)$ where $X$ is a compact metric space and $P$ is the law of a continuous stochastic process on $X$. We…
The aim of this work is to establish that two recently published projection theorems, one dealing with a parametric generalization of relative entropy and another dealing with R\'{e}nyi divergence, are equivalent under a correspondence on…