Related papers: Planar Earthmover is not in $L_1$
The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry. Most known constructions of linear embeddings that satisfy the…
The problem of computing a bi-Lipschitz embedding of a graphical metric into the line with minimum distortion has received a lot of attention. The best-known approximation algorithm computes an embedding with distortion $O(c^2)$, where $c$…
This paper pointed out that the usual gyrocenter transform, which implements single-parameter Lie transform perturbation theory on Lagrangian differential 1-form of the orbit of charged particles immersed in a strong magnetic field, is not…
We investigate an analogue of the irreducible convex paving in the context of generalised convexity. Consider two Radon probability measures $\mu,\nu$ ordered with respect to a cone $\mathcal{F}$ of functions on $\Omega$ stable under…
We show that for every nondecreasing concave function w:R+ --> R+ with w(0)=0, either every finite metric space embeds with distortion arbitrarily close to 1 into a metric space of the form (X,w o d) for some metric d on X, or there exists…
We consider the space of geodesic laminations on a surface, endowed with the Hausdorff metric d_H and with a variation of this metric called the d_log metric. We compute and/or estimate the Hausdorff dimensions of these two metrics. We also…
Inspired by the construction of the F{\"o}llmer process, we construct a unit-time flow on the Euclidean space, termed the F{\"o}llmer flow, whose flow map at time 1 pushes forward a standard Gaussian measure onto a general target measure.…
We study approximation of the embedding $\ell_p^m \rightarrow \ell_{\infty}^m$, $1 \leq p \leq 2$, based on randomized adaptive algorithms that use arbitrary linear functionals as information on a problem instance. We show upper bounds for…
We present an implementation of the ballistic Landauer-B\"uttiker transport scheme in one-dimensional systems based on density functional theory (DFT) calculations within the full-potential linearized augmented plane-wave (FLAPW) method. In…
We describe the electronic conductivity, as a function of the Fermi energy, in the Bernal bilayer graphene (BLG) in presence of a random distribution of vacancies that simulate resonant adsorbates. We compare it to monolayer (MLG) with the…
Local covariance structure under the manifold setup has been widely applied in the machine learning society. Based on the established theoretical results, we provide an extensive study of two relevant manifold learning algorithms, empirical…
Trotterization is a technique that allows one to approximate a time evolution of a Hamiltonian by repeatedly evolving the individual terms of the Hamiltonian one-at-a-time for small time durations. Bounds on the error of this approximation…
In this paper we study the embedding properties for the weighted Sobolev space $H^1_V(\mathbb{R}^N)$ into the Lebesgue weighted space $L^\tau_W(\mathbb{R}^N)$. Here $V$ and $W$ are diverging weight functions. The different behaviour of $V$…
We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We start with the computation of the $L_1$ maximum-projection principal component of a data…
The advantages of adaptivity and feedback are of immense interest in signal processing and communication with many positive and negative results. Although it is established that adaptivity does not offer substantial reductions in minimax…
Caffarelli's contraction theorem states that the Brenier optimal transport map from the standard Gaussian measure to a more log-concave probability measure is 1-Lipschitz. Owing to its many applications in analysis, probability, and…
Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…
We revisit the issue of low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective.Let $M=M(G)$ be the shortest path metric of an edge…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
Consider a graph $G = (V, E)$ and some commuters, each specified by a tuple $(u, v, b)$ consisting of two nodes in the graph $u, v \in V$ and a non-negative real number $b$, specifying their budget. The goal is to find a pricing function…