Related papers: A sharp inequality for transport maps in W^{1,p}(R…

In view of the applications to the asymptotic analysis of a family of obstacle problems, we consider a class of convex local functionals $F(u,A)$, defined for all functions $u$ in a suitable vector valued Sobolev space and for all open sets…

We consider the generalized Wirtinger inequality \[ (\int_{0}^{T} a |u|^q )^{1/q} \le C \biggm(\int_{0}^{T} a^{1-p} |u'|^{p}\biggm)^{1/p}, \] with $p,q>1$, $T>0$, $a\in L^1[0,T]$, $a\ge0$, $a\not\equiv0$ and where $u$ is a $T$-periodic…

We establish a dimension-free improvement of Talagrand's Gaussian transport-entropy inequality, under the assumption that the measures satisfy a Poincar\'e inequality. We also study stability of the inequality, in terms of relative entropy,…

Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…

The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…

We introduce a new operation between nonnegative integrable functions on $\mathbb{R} ^n$, that we call geometric combination; it is obtained via a mass transportation approach, playing with inverse distribution functions. The main feature…

Let $\Omega$ be a bounded, smooth domain of $\mathbb{R}^{N},$ $N\geq1.$ For each $p>N$ we study the optimal function $s=s_{p}$ in the pointwise inequality \[ \left\vert v(x)\right\vert \leq s(x)\left\Vert \nabla v\right\Vert…

We establish Sobolev-Poincar\'e inequalities for piecewise $W^{1,p}$ functions over families of fairly general polytopic (thence also shape-regular simplicial and Cartesian) meshes in any dimension; amongst others, they cover the case of…

In this paper we show a density property for fractional weighted Sobolev spaces. That is, we prove that any function in a fractional weighted Sobolev space can be approximated by a smooth function with compact support. The additional…

We show that every Sobolev function in $W^{1,p}_{\textrm{loc}}(U)$ on a $p$-quasiopen set $U \subset {\bf R}^n$ with a.e.-vanishing $p$-fine gradient is a.e.-constant if and only if $U$ is $p$-quasiconnected. To prove this we use the theory…

For a given Finsler-Minkowski norm $\mathcal{F}$ in $\mathbb{R}^N$ and a bounded smooth domain $\Omega\subset\mathbb{R}^N$ $\big(N\geq 2\big)$, we establish the following weighted anisotropic Sobolev inequality $$ S\left(\int_{\Omega}|u|^q…

The purpose of this short note is to demonstrate uniform logarithmic Sobolev inequalities for the mean field gradient particle systems associated to an energy functional that is convex in the flat sense. A defective log-Sobolev inequality…

We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…

We revisit entropy methods to prove new sharp trace logarithmic Sobolev and sharp Gagliardo-Nirenberg-Sobolev inequalities on the half space, with a focus on the entropy inequality itself and not the actual flow, allowing for somewhat…

We show that a class of Poincar\'e-Wirtinger inequalities on bounded convex sets can be obtained by means of the dynamical formulation of Optimal Transport. This is a consequence of a more general result valid for convex sets, possibly…

Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…

We show that the quadratic transportation cost inequality $T_2$ is equivalent to both a Poincar\'e inequality and a strong form of the Gaussian concentration property. The main ingredient in the proof is a new family of inequalities, called…

Entropic optimal transport (OT) and the Sinkhorn algorithm have made it practical for machine learning practitioners to perform the fundamental task of calculating transport distance between statistical distributions. In this work, we focus…

We present an optimal transport framework for performing regression when both the covariate and the response are probability distributions on a compact Euclidean subset $\Omega\subset\mathbb{R}^d$, where $d>1$. Extending beyond compactly…

We show that under rather general circumstances, the almost everywhere pointwise inequality $|f|(x) \le Mf (x)$ is equivalent to a weak form of the Lebesgue density theorem, for totally bounded closed sets. We derive both positive and…