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
The edges of the complete graph on n vertices are assigned independent exponentially dis- tributed c...
To the memory of Vicent Caselles, an outstanding mathematician and friend. Abstract. We deal with an...
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The metho...
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...
International audienceWe investigate the average minimum cost of a bipartite matching, with respect ...
The random matching problem concerns the study of the transportation cost of empirical measures of i...
We study the asymptotic behaviour of the expected cost of the random matching problem on a $2$-dimen...
We investigate the average minimum cost of a bipartite matching between two samples of n independent...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
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 discuss the optimal matching solution for both the assignment problem and the matching problem in...
Abstract. We deal with an optimal matching problem, that is, we want to transport two measures to a ...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
The edges of the complete graph on n vertices are assigned independent exponentially dis- tributed c...
To the memory of Vicent Caselles, an outstanding mathematician and friend. Abstract. We deal with an...
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The metho...
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...
International audienceWe investigate the average minimum cost of a bipartite matching, with respect ...
The random matching problem concerns the study of the transportation cost of empirical measures of i...
We study the asymptotic behaviour of the expected cost of the random matching problem on a $2$-dimen...
We investigate the average minimum cost of a bipartite matching between two samples of n independent...
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem...
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 discuss the optimal matching solution for both the assignment problem and the matching problem in...
Abstract. We deal with an optimal matching problem, that is, we want to transport two measures to a ...
We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete ra...
The edges of the complete graph on n vertices are assigned independent exponentially dis- tributed c...
To the memory of Vicent Caselles, an outstanding mathematician and friend. Abstract. We deal with an...
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The metho...