Related papers: A Quantitative Cram\'er-Wold Theorem for Zolotarev…
An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…
Under correlation-type conditions, we derive an upper bound of order $(\log n)/n$ for the average Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. The result is based on improved…
Under Poincar\'e-type conditions, upper bounds are explored for the Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. Based on improved concentration inequalities on high-dimensional…
For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
We establish general upper bounds on the Kolmogorov distance between two probability distributions in terms of the distance between these distributions as measured with respect to the Wasserstein or smooth Wasserstein metrics. These bounds…
We show how a Cram\'er-Wold theorem for a family of multivariate probability distributions can be used to generate a similar theorem for mixtures (convex combinations) of distributions drawn from the same family. Using this abstract result,…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
According to a well-known theorem of Cram\'er and Wold, if $P$ and $Q$ are two Borel probability measures on $\mathbb{R}^d$ whose projections $P_L,Q_L$ onto each line $L$ in $\mathbb{R}^d$ satisfy $P_L=Q_L$, then $P=Q$. Our main result is…
In this paper we provide a new explicit bound on the total variation distance between a standardized partial sum of random variables belonging to a finite sum of Wiener chaoses and a standard normal random variable. We apply our result to…
In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…
The width $w$ of a curve $\gamma$ in Euclidean space $R^n$ is the infimum of the distances between all pairs of parallel hyperplanes which bound $\gamma$, while its inradius $r$ is the supremum of the radii of all spheres which are…
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…
This note is a continuation of the author's previous work on "Sharp bounds for the max-sliced Wasserstein distance." We use the same technique to obtain an upper bound for the expected max-sliced 2-Wasserstein distance between a compactly…
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…
This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…
We prove several new results around Gromov's waist theorem. We give a simple proof of Vaaler's theorem on sections of the unit cube using the Borsuk--Ulam--Crofton technique. We consider waists of real and complex projective spaces, flat…
The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…
We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…