We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the leading term in the asymptotic expansion of the expected quadratic transportation cost for empirical measures of two samples of independent uniform random variables in the square. Our technique is based on a rigorous formulation of the challenging PDE ansatz by Caracciolo et al. (Phys Rev E 90:012118, 2014) that linearizes the Monge–Ampère equation
We consider models of assignment for random N blue points and N red points on an interval of length ...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
Abstract. We deal with an optimal matching problem, that is, we want to transport two measures to a ...
We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the...
We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the...
We investigate the average minimum cost of a bipartite matching between two samples of n independent...
International audienceWe investigate the average minimum cost of a bipartite matching, with respect ...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We study the asymptotic behaviour of the expected cost of the random matching problem on a $2$-dimen...
The random matching problem concerns the study of the transportation cost of empirical measures of i...
We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
AbstractIn this paper we provide an asymptotic analysis of the optimal transport cost in some matchi...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We consider models of assignment for random N blue points and N red points on an interval of length ...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
Abstract. We deal with an optimal matching problem, that is, we want to transport two measures to a ...
We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the...
We prove asymptotic results for 2-dimensional random matching problems. In particular, we obtain the...
We investigate the average minimum cost of a bipartite matching between two samples of n independent...
International audienceWe investigate the average minimum cost of a bipartite matching, with respect ...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We study the asymptotic behaviour of the expected cost of the random matching problem on a $2$-dimen...
The random matching problem concerns the study of the transportation cost of empirical measures of i...
We discuss the equivalence relation between the Euclidean bipartite matching problem on the line and...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
AbstractIn this paper we provide an asymptotic analysis of the optimal transport cost in some matchi...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
We consider models of assignment for random N blue points and N red points on an interval of length ...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
Abstract. We deal with an optimal matching problem, that is, we want to transport two measures to a ...