Related papers: Summability estimates on transport densities with …

Optimal transport from the volume measure to a convex combination of Dirac measures yields a tessellation of a Riemannian manifold into pieces of arbitrary relative size. This tessellation is studied for the cost functions…

Given an open bounded subset $\Omega$ of $\mathbb{R}^n$, which is convex and satisfies an interior sphere condition, we consider the pde $-\Delta_{\infty} u = 1$ in $\Omega$, subject to the homogeneous boundary condition $u = 0$ on…

We prove the existence of generalised solutions of the Monge-Kantorovich equations with fractional $s$-gradient constraint, $0<s<1$, associated to a general, possibly degenerate, linear fractional operator of the type, \begin{equation*}…

Large optimal transport problems can be approached via domain decomposition, i.e. by iteratively solving small partial problems independently and in parallel. Convergence to the global minimizers under suitable assumptions has been shown in…

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 characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…

We consider a flocking system confined transversally between two infinite reflecting parallel walls separated by a distance $L_\perp$. Infinite or periodic boundary conditions are assumed longitudinally to the direction of collective…

We show, using symmetrization techniques, that it is possible to prove a comparison principle (we are mainly focused on $L^1$ comparison) between solutions to an elliptic partial differential equation on a smooth bounded set $\Omega$ with a…

We conjecture that the set of homogeneous probability measures on the maximal Satake compactification of an arithmetic locally symmetric space $S=\Gamma\backslash G/K$ is compact. More precisely, given a sequence of homogeneous probability…

Given~$s,\sigma\in(0,1)$ and a bounded domain~$\Omega\subset\R^n$, we consider the following minimization problem of $s$-Dirichlet plus $\sigma$-perimeter type $$ [u]_{ H^s(\R^{2n}\setminus(\Omega^c)^2) } +…

We consider the symmetric FEM-BEM coupling that connects two linear elliptic second order partial differential equations posed in a bounded domain $\Omega$ and its complement, where the exterior problem is restated by an integral equation…

We provide symmetrization results in the form of mass concentration comparisons for fractional singular elliptic equations in bounded domains, coupled with homogeneous external Dirichlet conditions. Two types of comparison results are…

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

In this work we present a numerical method for the Optimal Mass Transportation problem. Optimal Mass Transportation (OT) is an active research field in mathematics.It has recently led to significant theoretical results as well as…

Let $\Omega$ be a bounded domain in $\R^n$ whose boundary is $\ka{1,\,\gamma}$ for $\gamma\in(0,\,1)$. Consider the aggregation equation in the case of the initial condition being a positive multiple of the characteristic function of…

We study stability and sample complexity properties of divergence regularized optimal transport (DOT). First, we obtain quantitative stability results for optimizers of DOT measured in Wasserstein distance, which are applicable to a wide…

Consider the directed polymer in one space dimension in log-gamma environment with boundary conditions, introduced by Sepp{\"a}l{\"a}inen. In the equilibrium case, we prove that the end point of the polymer converges in law as the length…

Entropic optimal transport -- the optimal transport problem regularized by KL diver\-gence -- is highly successful in statistical applications. Thanks to the smoothness of the entropic coupling, its sample complexity avoids the curse of…

Entropic regularization provides a generalization of the original optimal transport problem. It introduces a penalty term defined by the Kullback-Leibler divergence, making the problem more tractable via the celebrated Sinkhorn algorithm.…

The least gradient problem (minimizing the total variation with given boundary data) is equivalent, in the plane, to the Beckmann minimal-flow problem with source and target measures located on the boundary of the domain, which is in turn…