ON THE CONVERGENCE RATE OF POTENTIALS OF BRENIER MAPS

The theory of optimal transportation has experienced a sharp increase in interest in many areas of economic research such as optimal matching theory and econometric identification. A particularly valuable tool, due to its convenient representation as the gradient of a convex function, has been the Brenier map: the matching obtained as the optimizer of the Monge–Kantorovich optimal transportation problem with the euclidean distance as the cost function. Despite its popularity, the statistical properties of the Brenier map have yet to be fully established, which impedes its practical use for estimation and inference. This article takes a first step in this direction by deriving a convergence rate for the simple plug-in estimator of the potential of the Brenier map via the semi-dual Monge–Kantorovich problem. Relying on classical results for the convergence of smoothed empirical processes, it is shown that this plug-in estimator converges in standard deviation to its population counterpart under the minimax rate of convergence of kernel density estimators if one of the probability measures satisfies the Poincaré inequality. Under a normalization of the potential, the result extends to convergence in the $L^2$ norm, while the Poincaré inequality is automatically satisfied. The main mathematical contribution of this article is an analysis of the second variation of the semi-dual Monge–Kantorovich problem, which is of independent interest.

Formulation of the inverse problem of calculating the optical surface for an illuminating beam with a plane wavefront as the Monge–Kantorovich problem

A problem of calculating a refractive surface that forms a required irradiance distribution in the far field in the case of a plane illuminating beam is considered. We show that this problem can be formulated as a mass transportation problem. The specific form of the cost function for this problem is obtained. It is shown that with a certain choice of coordinates, the cost function becomes quadratic. The resulting mass transportation problem also describes a problem of calculating a mirror, which can be considered as a special case of the problem of calculating a refractive surface.

On the matrix Monge–Kantorovich problem

The classical Monge–Kantorovich (MK) problem as originally posed is concerned with how best to move a pile of soil or rubble to an excavation or fill with the least amount of work relative to some cost function. When the cost is given by the square of the Euclidean distance, one can define a metric on densities called the Wasserstein distance. In this note, we formulate a natural matrix counterpart of the MK problem for positive-definite density matrices. We prove a number of results about this metric including showing that it can be formulated as a convex optimisation problem, strong duality, an analogue of the Poincaré–Wirtinger inequality and a Lax–Hopf–Oleinik–type result.