English
Related papers

Related papers: Entropy-based Bounds on Dimension Reduction in L_1

200 papers

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Computational Geometry · Computer Science 2021-10-08 Piotr Indyk , Tal Wagner

We prove that every proper ultrametric space isometrically embeds into $\ell_p$ for any $p\geq 1$. As an application we discuss an $\ell_p$-version of nonlinear Dvoretzky's theorem.

Metric Geometry · Mathematics 2012-03-09 Kei Funano

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…

Statistics Theory · Mathematics 2007-06-13 Fuchang Gao , Jon A. Wellner

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…

Combinatorics · Mathematics 2024-05-14 Kristina Oganesyan

We show that a subspace of of $\ell_\infty^N$ of dimension $n>(\log N\log \log N)^2$ contains $2$-isomorphic copies of $\ell_\infty^k$ where $k$ tends to infinity with $n/(\log N\log \log N)^2$. More precisely, for every $\eta>0$, we show…

Functional Analysis · Mathematics 2018-12-11 Gideon Schechtman , Nicole Tomczak--Jaegermann

We prove that for any given integer $c>0$ any metric space on $n$ points may be isometrically embedded into $l_{\infty}^{n-c}$ provided $n$ is large enough.

Combinatorics · Mathematics 2014-01-14 Fedor Petrov , Dmitri Stolyarov , Pavel Zatitskiy

$ \newcommand{\schs}{\scriptstyle{\mathsf{S}}_1} $For all $n \ge 1$, we give an explicit construction of $m \times m$ matrices $A_1,\ldots,A_n$ with $m = 2^{\lfloor n/2 \rfloor}$ such that for any $d$ and $d \times d$ matrices…

Metric Geometry · Mathematics 2019-01-29 Oded Regev , Thomas Vidick

We consider the problem of embedding a finite set of points $\{x_1, \ldots, x_n\} \in \mathbb{R}^d$ that satisfy $\ell_2^2$ triangle inequalities into $\ell_1$, when the points are approximately low-dimensional. Goemans (unpublished,…

Data Structures and Algorithms · Computer Science 2017-06-22 Yuval Rabani , Rakesh Venkat

We study properties of twisted unions of metric spaces introduced by Johnson, Lindenstrauss, and Schechtman, and by Naor and Rabani. In particular, we prove that under certain natural mild assumptions twisted unions of $L_1$-embeddable…

Metric Geometry · Mathematics 2021-12-20 Mikhail Ostrovskii , Beata Randrianantoanina

We derive a lower bound on the smallest output entropy that can be achieved via vector quantization of a $d$-dimensional source with given expected $r$th-power distortion. Specialized to the one-dimensional case, and in the limit of…

Information Theory · Computer Science 2017-03-27 Tobias Koch , Gonzalo Vazquez-Vilar

Various new nonembeddability results (mainly into $L_1$) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on $\{0,1\}^d$ has $L_1$ distortion $(\log d)^{\frac12-o(1)}$. We also give new lower bounds on the…

Functional Analysis · Mathematics 2007-05-23 Subhash Khot , Assaf Naor

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Discrete Mathematics · Computer Science 2010-03-03 Anastasios Zouzias

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

Computational Geometry · Computer Science 2019-05-08 Mahdi Imanparast , Seyed Naser Hashemi , Ali Mohades

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

The Dushnik--Miller dimension of a poset $P$ is the least $d$ for which $P$ can be embedded into a product of $d$ chains. Lewis and Souza showed that the dimension of the divisibility order on the interval of integers $[N/\kappa, N]$ is…

Combinatorics · Mathematics 2023-11-15 Milan Haiman

Data subsampling is one of the most natural methods to approximate a massively large data set by a small representative proxy. In particular, sensitivity sampling received a lot of attention, which samples points proportional to an…

Data Structures and Algorithms · Computer Science 2024-06-04 Alexander Munteanu , Simon Omlor

We prove that for any positive integers $n$ and $d$ there exists a collection consisting of $f=d\log n+O(1)$ subsets $A_1, A_2, \ldots, A_f$ of $[n]$ such that for any two distinct subsets $X$ and $Y$ of $[n]$ whose size is at most $d$…

Combinatorics · Mathematics 2016-03-22 Christian Reiher

We prove that if $E \subseteq \mathbb{R}^d$ ($d\geq 2$) is a Lebesgue-measurable set with density larger than $\frac{n-2}{n-1}$, then $E$ contains similar copies of every $n$-point set $P$ at all sufficiently large scales. Moreover,…

Classical Analysis and ODEs · Mathematics 2023-01-03 Kenneth Falconer , Vjekoslav Kovač , Alexia Yavicoli

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

Probability · Mathematics 2024-12-23 Joscha Prochno , Christoph Thaele , Philipp Tuchel