Related papers: Planar Earthmover is not in $L_1$
Optimal transport (OT) has gained popularity due to its various applications in fields such as machine learning, statistics, and signal processing. However, the balanced mass requirement limits its performance in practical problems. To…
We prove embeddings of Sobolev and Hardy-Sobolev spaces into Besov spaces built upon certain mixed norms. This gives an improvment of the known embeddings into usual Besov spaces. Applying these results, we obtain Oberlin type estimates of…
We investigate lossy compression (source coding) of data in the form of permutations. This problem has direct applications in the storage of ordinal data or rankings, and in the analysis of sorting algorithms. We analyze the rate-distortion…
We prove that, when a path of length n is embedded in R^2, the 3-distortion is an Omega(n^{1/2}), and that, when embedded in R^d, the 3-distortion is an O(n^{1/d-1}).
This paper is concerned with a posteriori error bounds for linear transport equations and related questions of contriving corresponding adaptive solution strategies in the context of Discontinuous-Petrov-Galerkin schemes. After indicating…
We present a formalism to compute Lagrangian displacement fields for a wide range of cosmologies in the context of perturbation theory up to third order. We emphasize the case of theories with scale dependent gravitational strengths, such…
We introduce an amalgam type space, a subspace of $L^1(\mathbb R_+).$ Integrability results for the Fourier transform of a function with the derivative from such an amalgam space are proved. As an application we obtain estimates for the…
Matching a source to a target probability measure is often solved by instantiating a linear optimal transport (OT) problem, parameterized by a ground cost function that quantifies discrepancy between points. When these measures live in the…
Cohen-Addad, Le, Pilipczuk, and Pilipczuk [CLPP23] recently constructed a stochastic embedding with expected $1+\varepsilon$ distortion of $n$-vertex planar graphs (with polynomial aspect ratio) into graphs of treewidth…
The Earth Mover's Distance (EMD) is a state-of-the art metric for comparing discrete probability distributions, but its high distinguishability comes at a high cost in computational complexity. Even though linear-complexity approximation…
The Gridding algorithm has shown great utility for reconstructing images from non-uniformly spaced samples in the Fourier domain in several imaging modalities. Due to the non-uniform spacing, some correction for the variable density of the…
It was conjectured by Gupta et al. [Combinatorica04] that every planar graph can be embedded into $\ell_1$ with constant distortion. However, given an $n$-vertex weighted planar graph, the best upper bound on the distortion is only…
Low-distortion embeddings are critical building blocks for developing random sampling and random projection algorithms for linear algebra problems. We show that, given a matrix $A \in \R^{n \times d}$ with $n \gg d$ and a $p \in [1, 2)$,…
Given a dynamic graph subject to insertions and deletions of edges, a natural question is whether the graph presently admits a planar embedding. We give a deterministic fully-dynamic algorithm for general graphs, running in amortized…
Airborne electromagnetic surveys may consist of hundreds of thousands of soundings. In most cases, this makes 3D inversions unfeasible even when the subsurface is characterized by a high level of heterogeneity. Instead, approaches based on…
In this paper, we prove that any non-positively curved 2-dimensional surface (alias, Busemann surface) is isometrically embeddable into $L_1$. As a corollary, we obtain that all planar graphs which are 1-skeletons of planar non-positively…
The paper starts with discussion of applications of cycle spaces to transportation cost. After a short survey of the known results on cycle spaces, we turn to the study of minimal projections onto cycle spaces in the corresponding…
A classic problem in unsupervised learning and data analysis is to find simpler and easy-to-visualize representations of the data that preserve its essential properties. A widely-used method to preserve the underlying hierarchical structure…
We consider symmetry operations on the four-dimensional vector space that is spanned by the local versions of the Minkowski functionals (or fundamental measures): volume, surface, integral mean curvature, and Euler characteristic, of an…
We prove some probabilistic estimates for tensor products of random vectors. As an application we obtain embeddings of certain matrix spaces into $L_1$.