On the optimal map in the 2-dimensional random matching problem
Luigi Ambrosio, Federico Glaudo, Dario Trevisan

TL;DR
This paper demonstrates that on a 2D compact manifold, the optimal transport map in a semi-discrete random matching problem can be effectively approximated by a simple analytical form involving the solution to a Poisson equation, confirming a scaling hypothesis.
Contribution
It establishes a rigorous approximation of the optimal transport map using the Poisson problem, extending previous hypotheses to include the map's behavior on manifolds.
Findings
Optimal map approximated by identity plus gradient of Poisson solution
Validation of Caracciolo et al.'s scaling hypothesis for the map
New stability result for optimal transport maps on manifolds
Abstract
We show that, on a -dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the -norm by identity plus the gradient of the solution to the Poisson problem , where is an appropriate regularization of the empirical measure associated to the random points. This shows that the ansatz of Caracciolo et al. (Scaling hypothesis for the Euclidean bipartite matching problem) is strong enough to capture the behavior of the optimal map in addition to the value of the optimal matching cost. As part of our strategy, we prove a new stability result for the optimal transport map on a compact manifold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the optimal map in the -dimensional random matching problem
L. Ambrosio
Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy
,
F. Glaudo
ETH, Rämistrasse 101, 8092 Zürich, Switzerland
and
D. Trevisan
Dipartimento di matematica, Università di Pisa, Largo Bruno Pontecorvo 56127, Pisa
Abstract.
We show that, on a -dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the -norm by identity plus the gradient of the solution to the Poisson problem , where is an appropriate regularization of the empirical measure associated to the random points. This shows that the ansatz of [Car+14] is strong enough to capture the behavior of the optimal map in addition to the value of the optimal matching cost.
As part of our strategy, we prove a new stability result for the optimal transport map on a compact manifold.
1. Introduction
Let be independent random points uniformly distributed on the square . The semi-discrete random matching problem concerns the study of the properties of the optimal coupling (with respect to a certain cost) of these points with the Lebesgue measure \mathscr{L}^{2}\raisebox{-1.29167pt}{|}_{\left[0,\,1\right]^{2}}.
More precisely, denoting the empirical measure and \mathrm{m}\coloneqq\mathscr{L}^{2}\raisebox{-1.29167pt}{|}_{\left[0,\,1\right]^{2}}, we want to investigate the optimal transport from to .
The ultimate goal is understanding both the distribution of the random variable associated to the optimal transport cost and the properties of the (random) optimal map. In the present paper we will show that the optimal transport map can be well-approximated by the identity plus the gradient of the solution of a Poisson problem. In the large literature devoted to the matching problem, we believe that (except for the 1-dimensional case) this is one of the few results describing the behavior of the optimal map, and not only of the transport cost, see also [GHO18] in connection with the behavior of the optimal transport map in the Lebesgue-to-Poisson problem on large scales.
Before going on, let us briefly recall the definitions of optimal transport and Wasserstein distance. We suggest the monographs [Vil08, San15] for an introduction to the topic.
Definition 1.1** (Wasserstein distance).**
Let be a compact metric space and let be probability measures. Given , we define the -Wasserstein distance between and as
[TABLE]
where is the set of all such that the projections , , on the two factors are and , that is and .
Remark 1.2*.*
The infimum in the previous definition is always attained ([San15, Theorem 1.4]).
Moreover, if is a Riemannian manifold and , where is the volume measure of the manifold, the Wasserstein distance is realized by a map ([McC01]). Namely, the infimum 1.1 is attained and the unique minimizer is induced by a Borel map , so that and
[TABLE]
Even though the square is a fundamental example, the random matching problem makes perfect sense even in more general spaces (changing the reference measure accordingly). Historically, in the combinatorial literature111In the combinatorial literature the problem considered was the bipartite matching problem, in which two independent random point clouds have to be matched. The semi-discrete matching and the bipartite matching are tightly linked and, given that we will consider only the former, we are going to talk about the combinatorial literature as if it were considering the semi-discrete matching., the most common ambient space was for some and the aspect of the problem that attracted more attention was estimating the expected value of the cost. In the papers [AKT84, Tal92, DY95, Led17] (and possibly in other ones) the problem was solved in all dimensions and for all , obtaining the growth estimates222The notation means that there exists a positive constant such that for every .
[TABLE]
As might be clear from the presence of a logarithm, the matching problem exhibits some unexpected behavior in dimension .
See the introductions of [AG18, Led17] or [Tal14, Chapter 4, 14, 15] for a more in-depth description of the history of the problem.
Nowadays the topic is active again ([HPZ18, Tal18, GHO18, Led17, AG18, Led18, Led19]), also as a consequence of [AST18], in which the authors, following an ansatz suggested in [Car+14], manage to obtain the leading term of the asymptotic expansion of the expected matching cost in dimension with respect to the quadratic distance333The notation means that when .:
[TABLE]
The approach is far from being combinatorial, indeed it relies on a first-order approximation of the Wasserstein distance with the negative Sobolev norm. Their proof works on any closed compact -dimensional manifold.
Given that we will build upon it, let us give a brief sketch of the approach. What we are going to describe is simpler than the original approach of [AST18] and can be found in full details in [AG18]. For simplicity we will assume to work on the square.
Let be the optimal map from to , whose existence is ensured by Brenier’s Theorem (see [Bre91]). Still by Brenier’s Theorem, we know that , where is the identity map and is a convex function. With high probability is well-spread on the square, thus we expect to be very small. We know and we would like to apply the change of variable formula to deduce something on the Hessian of . The issue is that the singularity of prevents a direct application of the change of variable formula. Anyhow, proceeding formally we obtain . Going on with the formal computation, if we consider only the first order term of the left hand side, the previous identity simplifies to
[TABLE]
Somewhat unexpectedly, this last equation makes perfect sense. Therefore we might claim that if we define as the solution of (with null Neumann boundary condition), then is well-approximated by and furthermore the transport cost is well-approximated by .
This conjecture is appealing, but false, if taken literally. Indeed, it is very easy to check that the integral diverges.
The ingredient that fixes this issue is a regularization argument. More precisely, let be the evolution at a certain small time of the empirical measure through the heat semigroup (see [Cha84, Chapter 6]). If we repeat the ansatz with replaced by we obtain a function that solves
[TABLE]
with null Neumann boundary conditions. Let us remark that in fact .
Once again, we can hope that approximates very well and furthermore that the transport cost from to is well-approximated by .
This time the predictions are sound. Choosing carefully the time , we can show that, with high probability, the map is optimal from to and the Dirichlet energy of approximate very well . Only one part of the conjecture is left unproven by [AG18]: is it true that approximates, in some adequate sense, the optimal map ? The goal of the present paper is to answer positively this question.
We are going to prove the following.
Theorem 1.3**.**
Let be a -dimensional closed compact Riemannian manifold (or the square ) whose volume measure is a probability. We will denote with the Riemannian distance on .
Given , let be independent random points -uniformly distributed on . Let us denote the empirical measure associated to the random point cloud and let be the optimal transport map from to .
For a fixed time , let and let be the unique null-mean solution444If we ask also that satisfies the null Neumann boundary conditions. of the Poisson problem .
If we set , on average is very close to in the -norm, that is
[TABLE]
In particular,
[TABLE]
Remark 1.4*.*
To handle the case of the square some care is required. Indeed the presence of boundary makes things more delicate. This is the reason why only the square is considered in the theorem and not any -dimensional compact manifold with boundary.
See [AG18, Subsection 2.1 and Remark 3.10] for some further details on this matter.
Remark 1.5*.*
By McCann’s Theorem [McC01] we can write , hence a natural question is if 1.3 holds with in place of . Using the fact that the exponential map restricted to a sufficiently small neighbourhood of the null vector field is a global diffeomorphism with its image, it would be sufficient to show that, for every , , as . We will prove this estimate in Proposition 4.7, that provides the desired approximation at the level of the gradients
[TABLE]
The strategy of the proof is to show that the information that we already have on (namely that it is an optimal map between and some measure that is very close to ) is enough to deduce that it must be near to the optimal map .
As part of the strategy of proof, we obtain, in Section 3, a new stability result for the optimal transport map on a general compact Riemannian manifold (not only of dimension ). This is the natural generalization to Riemannian manifolds of [Gig11]. The said stability result follows rather easily from the study of the short-time behavior of the Hopf-Lax semigroup we perform in Section 2. The Hopf-Lax semigroup comes up in our investigation as, when , it becomes the operator of -conjugation and thus produce the second Kantorovich potential once the first is known (see [San15, Section 1.2] for the theory of Kantorovich potentials and -conjugation).
The main theorem is established in Section 4.
*Acknowledgments. * F. Glaudo has received funding from the European Research Council under the Grant Agreement No 721675. L. Ambrosio acknowledges the support of the MIUR PRIN 2015 project.
1.1. Notation for constants
We will use the letters and to denote constants, whose dependencies are denoted by . The value of such constants can change from one time to the other.
Moreover we will frequently use the notation to hide a constant that depends only on the ambient manifold . This expression means that there exists a constant such that .
2. Short-time behavior of the Hopf-Lax semigroup with datum in
Let us begin recalling the definition of the Hopf-Lax semigroup (also called Hamilton-Jacobi semigroup).
Definition 2.1** (Hopf-Lax semigroup).**
Let be a compact length space555A metric space is a length space if the distance between any two points is the infimum of the length of the curves between the two points. Let us remark that for the definition we need neither the compactness nor the length property of , but without these assumptions many of the properties of the Hopf-Lax semigroup fail (first of all the fact that it is a semigroup).. For any function and any , let be defined by
[TABLE]
Without additional assumptions on or it is already possible to deduce many properties of the Hopf-Lax semigroup. Let us give a very short summary of the most important ones.
- •
When the functions converge uniformly to .
- •
The Hopf-Lax semigroup is indeed a semigroup, that is for any .
- •
In a suitable weak sense,the Hamilton-Jacobi equation
[TABLE]
holds. Let us emphasize that the mentioned equation does not make sense if we don’t give an appropriate definition of norm of the gradient as we are working in a metric setting.
See [LV07], in particular Theorem 2.5, for a detailed proof of the mentioned properties.
There is a vast literature investigating the regularity properties of the Hopf-Lax semigroup and its connection with the Hamilton-Jacobi equation, in particular that it is the unique solution in the viscosity sense (see for instance [Lio82, Ben77, BC08]). Nonetheless we could not find a complete reference for the short-time behavior of the Hopf-Lax semigroup on a Riemannian manifold (as the majority of the results are stated on the Euclidean space) with a relatively regular initial datum (namely ). This is exactly the topic of this section.
What we are going to show, apart from (3), is not new. For instance, in [Fat03, Section 5], the author proves the validity of the method of characteristics in a way very similar to ours. In that paper more general Lagrangians are considered and as a consequence the proofs are more involved and require much more geometric tools and notation.
For us, the ambient space is a compact Riemannian manifold and the function is differentiable with Lipschitz continuous gradient. Moreover, either is closed or it is the square . For a general manifold with boundary the results are false, the square is special because its boundary is piecewise geodesic. Handling all manifolds with totally geodesic boundary would be possible, but would require some additional care. In order to simplify the exposition we decided to state the results only for the square. Throughout this section we will often use implicitly that a Lipschitz continuous function is differentiable almost everywhere (see [EG92, Theorem 3.2]).
We will show that, up to a small time that depends on the -norm of , the Hopf-Lax semigroup is as good as one might hope. We will describe explicitly the minimizer of the variational problem that defines deducing some explicit formulas for and its gradient and we will show that solves the Hamilton-Jacobi equation in the classical sense. Finally we will be able to control the -norm of and the -norm of .
How can we achieve these results for short times when ? The main ingredient is the possibility to identify the minimizer in the definition of . Given , let be the unique geodesic with and . If , then the minimizer in the definition of is exactly . This approach is exactly the method of characteristics when applied on a Riemannian manifold (straight lines on a manifold are geodesics).
Let us begin with a technical lemma.
Lemma 2.2**.**
Let be a closed compact Riemannian manifold (or the square ).
There exists a constant such that the following statement holds. Let be a Lipschitz continuous vector field666If we ask also that is tangent to the boundary. with and and, for any , let be the map defined as , where denotes the exponential map. For any , the map is a homeomorphism such that , and the vector field defined as
[TABLE]
is Lipschitz continuous with .
Proof.
We will give only a sketch of the proof of the first part of the statement as the argument is well-known.
Let us begin by proving the result when is closed (in particular we exclude only ).
We can deduce the first part of the statement from the fact that is injective and locally (i.e. on sufficiently small balls) it is a bi-Lipschitz transformation with its image.
Working in a suitably chosen finite atlas (whose existence follows from the compactness of ), the fact that is a bi-Lipschitz diffeomorphism is a consequence of the following very well-known lemma about perturbations of the identity (see [Rud+76, Theorem 9.24] or [Fat03, Theorem 5.3]). If is such that is -Lipschitz with , then is locally invertible and .
The global injectivity follows directly from the fact that it is locally bi-Lipschitz. Indeed if then and therefore we can exploit the local injectivity of .
When we need only a simple additional remark. Given that is tangent to the boundary, the map is a homeomorphism of the boundary. As a consequence of this fact, it is not difficult to prove (by injectivity) that the image of the interior of the square is mapped by in itself. From here on we can simply mimic the proof described above for closed manifolds and achieve the result also for the case of the square.
We move our attention to the second part of the statement. By a simple homogeneity argument, it is sufficient to prove that .
Once again we work in chart. Let be the domain of the chart. As usual, can be understood as a vector field on and as a map from into . Choosing the chart appropriately, we can assume that the Euclidean distance is bi-Lipschitz equivalent to the distance induced by the metric .
The Lipschitz continuity of with respect to the metric is equivalent to proving that, for any , it holds
[TABLE]
where all the absolute values are with respect to the standard Euclidean norm. Since is surjective, it is sufficient to prove that, for any , it holds
[TABLE]
Given that is Lipschitz, we already know
[TABLE]
Let be the unique geodesic, with respect to , such that and . Let be defined analogously. By definition, it holds
[TABLE]
Taking into account 2.1, 2.2 and 2.3, the Lipschitz continuity of would follow from the inequality
[TABLE]
The curves are geodesics, hence the vectors and solve the same autonomous ordinary differential equation with different initial data. Hence 2.4 follows from the well-known Lipschitz dependence of the solution from the initial data (see [Tes12, Theorem 2.6]) and therefore the proof is concluded. ∎
We can now state and prove the main theorem of this section. The technically demanding part of these notes is entirely enclosed in the following theorem.
Theorem 2.3**.**
Let be a closed compact Riemannian manifold (or the square ).
Let be a scalar function777If we ask also that satisfies the null Neumann boundary conditions. and, for any positive time , let us define the map as .
There exists a constant such that the following properties hold for any time :
- ((1))
The map is a bi-Lipschitz homeomorphism such that . 2. ((2))
For any , it holds
[TABLE] 3. ((3))
For any , one has the (strict-convexity-like) estimate
[TABLE] 4. ((4))
The function is Lipschitz continuous in time and in space. In particular we have and . 5. ((5))
The function is a classical solution of the Hamilton-Jacobi equation
[TABLE] 6. ((6))
For any , if is the geodesic such that and , then it holds
[TABLE] 7. ((7))
One has
[TABLE]
Proof.
Thanks to the following homogeneity, for any and , of the Hopf-Lax semigroup
[TABLE]
we can assume without loss of generality that and prove that the statements hold up to time . Thus, we will implicitly assume that the time variable satisfies . We will choose the value of the constant during the proof, it should be clear that all constraints we impose depend only on the manifold and not on the function .
The statement of (1) follows from Lemma 2.2.
To prove (2) we need some preliminary observations. If is sufficiently small (so that the constraint on is sufficiently strong), thanks to the compactness of we can find a radius such that:
- (a)
If satisfy then
[TABLE] 2. (b)
For any , to compute it is sufficient to minimize on :
[TABLE] 3. (c)
For any it holds the inequality . In particular we can assume that is not in the cut-locus of . 4. (d)
For any it holds the identity
[TABLE]
This identity can be shown computing the gradient of the distance from squared, since we know that where . Indeed, given that does not belong to the cut-locus of , we know
[TABLE]
and the desired identity follows.
With these observations at our disposal, the proof of (2) is straight-forward. Given a time and a point , let us consider the function defined as
[TABLE]
We know that . Moreover and, if the constraint on is sufficiently small, we also know in . Hence, by convexity, we deduce that is the global minimum point of and (2) follows.
Let us now move to the proof of (3). Let be such that and . Applying (2) and recalling that is a bi-Lipschitz diffeomorphism, we can see that the inequality we want to prove is equivalent to
[TABLE]
and, using the same notation as above, this becomes
[TABLE]
The latter inequality follows from the strict convexity of that we have already shown while proving (2).
Showing from scratch that solves the Hamilton-Jacobi equation would not be hard, but for this we refer to [LV07, Theorem 2.5, viii], where the authors show that is a suitably weak solution of the Hamilton-Jacobi equation. From their statement, we can deduce that if is differentiable at , then
[TABLE]
Since we will show that is , the validity of (4) and (5) is a consequence of 2.5.
The first part of (6), namely , is implied by (2). To obtain the identity involving the gradient, let us differentiate the previous equality with respect to the time variable. If is differentiable at , it holds
[TABLE]
Applying (5) and the fact that , from 2.6 we can deduce
[TABLE]
This does not imply directly (6) since we have shown the identity only if is differentiable at . As a byproduct of (2), we know that is Lipschitz continuous and therefore, from 2.7, we can deduce that, fixed , for almost every it holds
[TABLE]
Since the right-hand side is Lipschitz continuous (see Lemma 2.2) it follows that and, as anticipated, this concludes the proofs of (4),(5) and (6).
Finally let us tackle (7). Given , let . Thanks to (6), if we consider the geodesic such that and , we know that and .
Thus we have
[TABLE]
and this is the desired statement. ∎
Remark 2.4*.*
Let us emphasize that the only statement contained in Theorem 2.3 that we are going to use is (3). Indeed it will be crucial when studying the stability of optimal maps. Furthermore, such a statement should be seen more like as a property of the -conjugate (see [San15, Section 1.2]) than as a property of the Hopf-Lax semigroup.
We have proven all other statements in order to give a complete reference on the short-time behavior of the Hopf-Lax semigroup when the initial datum is in .
3. Quantitative Stability of the Optimal Map
In this section we will always refer to the optimal transport with respect to the quadratic cost between two probability measures in that are absolutely continuous with respect to the volume measure of a compact Riemannian manifold .
The duality theory of optimal transport can be seen as a tool to bound from above and from below the optimal transport cost. Indeed, simply producing a transport map we can bound the cost from above, whereas with a pair of potentials we can bound it from below. Estimating the optimal cost is the best one can desire for a generic convex problem, but for the optimal transport problem we know that the optimal map is unique (see [McC01]) and thence we would like to be able to approximate it.
In details, we want to investigate the following problem.
Problem 3.1**.**
Let be probability measures with . Let be the optimal transport maps from to and respectively. Estimate the -distance between the two maps.
The approach we are going to adopt builds upon the method, suggested to N.Gigli by the first author, who used it in [Gig11, Proposition 3.3 and Corollary 3.4]. In the proof of the mentioned results, the author obtains (even if not stated in this way) exactly the same inequality we are going to obtain. The substantial difference is that those results (and their proofs) work only when the ambient is the Euclidean space.
Transporting the proofs from the flat to the curved setting is not straight-forward. The proof of Proposition 3.3 of the mentioned paper does not work on a Riemannian manifold, because curvature comes into play when comparing tangent vectors at different points. To overcome this difficulty we have come up with (3) of Theorem 2.3. On the contrary, the proof of Corollary 3.4 is easily adapted on a compact Riemannian manifold.
Let us also mention the recent result [Ber18, Theorem 4.1]. In the said theorem the author obtain a quantitative stability of the optimal map when, instead of changing the target measure as we are doing, the source measure is changed. The proof is totally different from ours and is mainly based on complex analytic tools. Also in that paper only the Euclidean setting (and the flat torus) is considered.
We will attack the stability problem only in the perturbative setting, namely when the optimal map from to is the identity up to the first order. Working only in the perturbative setting might look like an extremely strong assumption that would yield no applications at all. This is not the case, indeed what we call perturbative setting is more or less equivalent to requiring only that the optimal transport map is local (meaning that is uniformly small) and well-behaved. For example, and this is the whole point of [AG18], the optimal map from the reference measure to a random point cloud is (with high probability) a perturbation of the identity.
We don’t need any hypothesis on the optimal map between and .
Theorem 3.2**.**
Let be a closed compact Riemannian manifold (or the square ) and let us denote by its volume measure.
Let be three probability measures with and let be the optimal transport maps respectively for the pairs of measures and . We assume that where is a -function888If we ask also that satisfies the null Neumann boundary conditions. such that where is the constant considered in the statement of Theorem 2.3.
Then it holds
[TABLE]
Proof.
Let us consider a generic transport map from to and recall that, according to [Gla19], if is small enough, then the map is optimal.
Given , let us apply (3) of Theorem 2.3 with and and
[TABLE]
Integrating this inequality with respect to we obtain
[TABLE]
as the first two terms cancel thanks to the fact that both and sends into .
We can now prove the main statement under the additional assumption that there exists an optimal map from to . Applying 3.1 with we get
[TABLE]
Thanks to the triangle inequality, it holds
[TABLE]
Applying this last inequality into 3.2 yields
[TABLE]
and the desired statement follows from the triangle inequality
[TABLE]
It remains to drop the assumption on the existence of the optimal map . Given that our ambient manifold is compact, we can apply the nonquantitative strong stability (see [Vil08, Corollary 5.23]). Let us take a sequence of absolutely continuous probability measures that weakly converges to . Thanks to McCann’s Theorem (see [McC01]) the optimal map from to exists and thanks to the strong stability we know that the optimal maps from to converge strongly in to . Hence it is readily seen that the result for can be obtained by passing to the limit the result for . ∎
Remark 3.3*.*
The first part of the proof of Theorem 3.2 might seem a bit magical. Let us describe what is happening under the hood.
The function is the Kantorovich potential of the couple and hence, by standard theory in optimal transport, it must be -concave.
Our hypotheses ensure us that it is not only -concave, but even strictly -concave. Furthermore, the theory we have developed on the Hopf-Lax semigroup tells us that even the other potential is strictly -concave (this is exactly (3)).
The result follows integrating the strict -concavity inequality with respect to the measure .
Remark 3.4*.*
The main use of Theorem 3.2 is the following one. Assume that the optimal map from to is local and well-behaved (this ensures the validity of the hypotheses of the theorem) and furthermore that is much closer to than to . In this situation, the theorem tells us
[TABLE]
and this conveys exactly the information that approximates very well . Notice also that the improvement from dependence of [Gig11] to the kind of Lipschitz dependence is due to the fact that we are working in a perturbative regime, close to the reference measure.
4. Optimal map in the random matching problem
We want to apply our result on the stability of the optimal map in the perturbative setting to the semi-discrete random matching problem. In this section we will work on a compact closed Riemannian manifold of dimension (or the square ). We will denote with the volume measure, with the implicit assumption that it is a probability.
In this setting, the semi-discrete random matching problem can be formulated as follows. For a fixed , consider independent random points -uniformly distributed on . Study the optimal transport map (with respect to the quadratic cost) from to the empirical measure .
Since we want to attack the problem applying Theorem 3.2, first of all we have to choose and . The choices of and are very natural, indeed we set and . This way the map is .
Far less obvious is the choice of , and . As one might expect from the statement of Theorem 1.3 and from the ansatz described in the introduction, our choice is . Thus (for some appropriate ). Furthermore, keeping the same notation of [AG18], the measure will be denoted by .
First of all it is crucial to understand whether we are in position to apply Theorem 3.2. Indeed we need to check if and are sufficiently small. Moreover we have to obtain a strong estimate on . Both this facts are among the main results obtained in [AG18]. Hence let us state them in the following proposition.
Proposition 4.1** (Summary of results from [AG18]).**
Let be a closed compact -dimensional Riemannian manifold (or the square ) whose volume measure is a probability. Given , let be independent random points -uniformly distributed on and denote the associated empirical measure.
For a choice of the time , let be the evolution through the heat flow of the empirical measure and let be the unique null-mean solution999If we ask also that satisfies the null Neumann boundary conditions. to the Poisson equation . Finally, let us define the probability measure as the push-forward of through the map .
For any , let be the probabilistic event .
If and , the following statements101010In [AG18] the time is chosen as , where is a constant. As we clarify in Remark 4.3, the choice of the exponent of the logarithm in the definition of is not rigid. We choose the exponent instead of since it lets us get some estimates in a cleaner form and makes it possible to avoid inserting a constant in the definition of . hold
- •
We know the asymptotic behavior of the expected matching cost
[TABLE]
- •
The probability of the complement of decays faster than any power. In formulas, for any there exists a constant such that
[TABLE]
- •
One has the refined contractivity estimate111111This does not follow from the well-known contractivity property for the heat semigroup. Indeed the standard contractivity would yield an estimate of order and such magnitude is too large for our purposes.**
[TABLE]
- •
We are able to control the perturbation error with
[TABLE]
- •
When is sufficiently large, in the event the map is optimal from to .
Proof.
All of these results are contained in [AG18] and thus we will only give a precise reference for them. All references are to propositions contained in [AG18].
The validity of 4.1 is contained in Theorem 1.2. The fact that the event has overwhelming probability follows from Theorem 3.3. The refined contractivity estimate 4.3 is Theorem 5.2.
The estimate 4.4 follows from Equation 6.2 and Lemma 3.14. More specifically Equation 6.2 tells us that in the event it holds
[TABLE]
and Lemma 3.14 gives us the expected value of the Dirichlet energy of . The behavior in the complementary of can be ignored thanks to 4.2.
It remains to show that in the event , the map is optimal. This follows directly from [Gla19, Theorem 1.1]. ∎
Remark 4.2*.*
Let us repeat the elementary observation made in [AG18, Remark 5.3], as it will be useful.
Let be two random variables such that, in an event , it holds . Then
[TABLE]
In particular, if the infinity norm of is suitably controlled and the probability of is exceedingly small, we can assume up to a small error.
This observation allows us to restrict our study to the good event . Indeed all quantities involved in our computations have at most polynomial growth, whereas decays faster than any power.
Once we have these results in our hands, the proof of the main theorem follows rather easily. Indeed we just have to check that all assumptions of our stability result are satisfied.
Proof of Theorem 1.3.
Let us assume to be in the event with . Hence, thanks to • ‣ Proposition 4.1, we can apply Theorem 3.2 to the triple of measures , and (with and ). We obtain
[TABLE]
Recalling Remark 4.2 and 4.2, if we consider the expected value we can apply the latter inequality as if it were true unconditionally and not only in the event . Thus, taking the expected value and applying Cauchy-Schwarz’s inequality, we get
[TABLE]
The desired statement follows directly applying 4.1, 4.3 and 4.4. ∎
Remark 4.3*.*
It might seem that our choice of the time is a little arbitrary, and indeed it is. Any time of order , for some , would have worked flawlessly.
It remains to justify Remark 1.5. As already said, the desired estimate boils down to the validity of
[TABLE]
for any fixed . The strategy of the proof is as follows. With Lemma 4.4 (see also [GO17, Lemma 4.1]) we reduce the hard task of controlling the -distance between and to the easier task of controlling . This latter estimate is then shown to be a consequence of 4.2.
Lemma 4.4**.**
Let be a -dimensional compact Riemannian manifold (possibly with Lipschitz boundary) and let be the volume measure on .
If is the optimal map with respect to the quadratic cost from to , then one has
[TABLE]
Proof.
Since the map is optimal, its graph is essentially contained in -cyclically monotone set (see [San15, Theorem 1.38]). More precisely, there exists a Borel set such that is -cyclically monotone and is -negligible. We will reduce our considerations to points in in order to exploit the -cyclical monotonicity.
Let us fix a point and let us define . Let us define the point as the middle point between and , that is . Let us consider a point where is a small constant that will be chosen a posteriori. Finally let us define . We want to show that cannot be much smaller than .
Thanks to the -cyclical monotonicity of , it holds
[TABLE]
and thus, applying repeatedly the triangle inequality, we deduce
[TABLE]
If is chosen sufficiently small (i.e. ), the desired estimate follows.
Since can be chosen arbitrarily in , the estimate implies
[TABLE]
where we have used that a ball with radius not larger than the diameter of has measure comparable to (follows from the Ahlfors-regularity of compact Riemannian manifolds with Lipschitz boundary). This completes the proof since can be chosen arbitrarily in a set with full measure. ∎
Remark 4.5*.*
The previous lemma holds, with the same proof, on any Ahlfors-regular metric measure space that is also a length space.
Remark 4.6*.*
If we apply Lemma 4.4 on a -dimensional manifold with being the optimal map (with respect to the quadratic cost) from to the empirical measure , we obtain
[TABLE]
Since we know (as a consequence of 1.2) that with high probability , we deduce that with high probability it holds
[TABLE]
This estimate does not match the asymptotic behavior of the -Wasserstein distance between and . In fact, as proven in [LS89, S+91, TS15], with high probability it holds
[TABLE]
We are now ready to show 4.5 (to be precise we prove a much stronger estimate).
Proposition 4.7**.**
Using the same notation and definitions of the statement of Theorem 1.3, for any and any there exists a constant such that
[TABLE]
Proof.
We show that for any and any there exists a constant such that
[TABLE]
In fact, if we are able to prove 4.7, then the statement of the proposition follows applying Lemma 4.4 with (changing adequately and the value of the constant ).
The triangle inequality gives us
[TABLE]
The first term can be bounded using the contractivity property of the heat semigroup, obtaining
[TABLE]
For the second term we employ the transport inequality [AG18, (4.1)] and get
[TABLE]
If we assume to be in the event (that is defined in the statement of Proposition 4.1) with , we have
[TABLE]
Joining 4.8, 4.9, 4.10 and 4.11 we deduce that in the event it holds
[TABLE]
Since and as , this implies (for sufficiently large) that in the event it holds . Hence 4.7 is a consequence of 4.2 and this concludes of the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AG 18] Luigi Ambrosio and Federico Glaudo “Finer estimates on the 2-dimensional matching problem” In ar Xiv preprint ar Xiv:1810.07002 , 2018
- 2[AKT 84] Miklós Ajtai, János Komlós and Gábor Tusnády “On optimal matchings” In Combinatorica 4.4 Springer, 1984, pp. 259–264
- 3[AST 18] Luigi Ambrosio, Federico Stra and Dario Trevisan “A PDE approach to a 2-dimensional matching problem” In Probability Theory and Related Fields Springer, 2018, pp. 1–45
- 4[BC 08] Martino Bardi and Italo Capuzzo-Dolcetta “Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations” Springer Science & Business Media, 2008
- 5[Ben 77] Stanley H. Benton “The Hamilton-Jacobi equation: a global approach” Elsevier, 1977
- 6[Ber 18] Robert J. Berman “Convergence rates for discretized Monge-Ampère equations and quantitative stability of Optimal Transport” In ar Xiv preprint ar Xiv:1803.00785 , 2018
- 7[Bre 91] Yann Brenier “Polar factorization and monotone rearrangement of vector-valued functions” In Comm. Pure Appl. Math. 44.4 , 1991, pp. 375–417
- 8[Car+14] Sergio Caracciolo, Carlo Lucibello, Giorgio Parisi and Gabriele Sicuro “Scaling hypothesis for the Euclidean bipartite matching problem” In Physical Review E 90.1 APS, 2014, pp. 012118
