Annealed quantitative estimates for the quadratic 2D-discrete random matching problem
Nicolas Clozeau, Francesco Mattesini

TL;DR
This paper analyzes the quadratic 2D-discrete random matching problem on Riemannian manifolds, providing quantitative approximations of optimal transport plans for correlated and Markov chain samples.
Contribution
It introduces a novel approximation method for optimal transport plans using PDE linearization, applicable to correlated samples and Markov chains.
Findings
Optimal transport plans are well-approximated by PDE-based maps.
The method applies to correlated random points with exponential decay of mixing coefficients.
Results extend to discrete-time Markov chains with invariant measures.
Abstract
We study a random matching problem on closed compact -dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume measure with strictly positive and bounded density. We show that given two sequences of numbers and of points, asymptotically equivalent as goes to infinity, the optimal transport plan between the two empirical measures and is quantitatively well-approximated by where solves a linear elliptic PDE obtained by a regularized first-order linearization of the Monge-Amp\`ere equation. This is obtained in the case of samples of correlated random points for which a stretched exponential decay of the -mixing coefficient holds and for a class of discrete-time…
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.
Annealed quantitative estimates for the quadratic 2D-discrete random matching problem
Nicolas Clozeau Francesco Mattesini
IST Austria, Austria
Universität Münster & MPI Leipzig, Germany
Abstract.
We study a random matching problem on closed compact -dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume measure with strictly positive and bounded density. We show that given two sequences of numbers and of points, asymptotically equivalent as goes to infinity, the optimal transport plan between the two empirical measures and is quantitatively well-approximated by \big{(}\mathrm{Id},\exp(\nabla h^{n})\big{)}_{\#}\mu^{n} where solves a linear elliptic PDE obtained by a regularized first-order linearization of the Monge-Ampère equation. This is obtained in the case of samples of correlated random points for which a stretched exponential decay of the -mixing coefficient holds and for a class of discrete-time Markov chains having a unique absolutely continuous invariant measure with respect to the volume measure.
NC has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819)
FM is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the SPP 2265 Random Geometric Systems. FM has been funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2044 -390685587, Mathematics Münster: Dynamics–Geometry–Structure. FM has been funded by the Max Planck Institute for Mathematics in the Sciences.
**Keywords: **Optimal transport Matching problem Quantitative estimates
Contents
1. Introduction and statement of the main results
1.1. The random matching problem and its asymptotic
The random matching problem is a popular optimization problem at the interface between analysis and probability with applications in many different fields such as statistical physics [16, 44], computer science [40] and economics [20, 24]. Within the mathematical literature, it has been subject of intense studies due to its interactions with many areas, including for instance graph theory [38] and geometric probability [50]. In this paper we focus on one of its simple versions. Let and (with possibly ) be two families of random points on a compact Riemannian manifold (endowed with the Riemannian distance ). We are interested in the quadratic matching problem
[TABLE]
where
[TABLE]
Classically, (1.1) can be phrased in terms of a transport problem. Indeed, letting
[TABLE]
be the empirical measures associated to the two point clouds, the linear programming problem (1.1) amounts to determine the quadratic Wasserstein distance .
In the special case the Birkhoff-von Neumann’s Theorem provides a correspondence between (1.1) and the usual bipartite matching
[TABLE]
where denotes the set of injective maps . Indeed, since is a convex polytope, minimizers in (1.1) have to be searched among extremal points. By the Birkhoff-von Neumann Theorem [8, Lemma 2.1.3], the latter are nothing but permutation matrices (up to a factor ).
A first natural question is to understand the asymptotic of (1.1) as . For the same number of samples and independently and identically distributed (i.i.d.) on the unit square , the scaling of the cost (1.1) has been well understood in the mathematical and statistical physics literature. A simple heuristic argument, see for instance [44], suggests that given a point , we can find a point within a volume of order with high probability. For this reason, the typical inter-point distance is of order suggesting that the scaling of (1.1) is of order . Although attractive, this heuristic turns out to be unfortunately false in low dimension showing a critical behavior when . This critical case is the one on which we focus in this paper. Ajtai, Komlós and Tusnády in [1] were the first to show that, for i.i.d. uniform samples, a logarithmic correction is needed, deriving111We use the notation if there exists a global constant , which may only depend on , such that . We write if both and hold.
[TABLE]
extended later by Talagrand in [53] for clouds of i.i.d. points which are distributed accordingly to more general common law. A recent breakthrough was obtained within the physics community by Caracciolo, Lucibello, Parisi and Sicuro in [16], and further developed by Caracciolo and Sicuro in [17] and by Sicuro in [49], where the asymptotics of the cost are formally derived thanks to a novel PDE approach and optimal transport theory rather than combinatorics. A couple of years later, in general -dimensional compact Riemannian manifolds without boundary, the first-order asymptotic has been rigorously justified by Ambrosio, Stra and Trevisan in [6] for i.i.d. uniform samples and recently extended by Ambrosio, Goldman and Trevisan in [5] for samples distributed accordingly to more general laws which are absolutely continuous (with Hölder continuous density) w.r.t. the volume measure , leading to
[TABLE]
where denotes the Lebesgue measure of . The case with with similar rates is also covered, see [5, Theorem 1.2].
The novel approach introduced in [16], later revised in [11] consists on a linearization of the Monge-Amperé equation that allows for an explicit description of the cost thanks to the linearized proxies (see Section 1.2 for more details). The aim of this work is to quantitatively justify the linearization ansatz in terms of convergence of the approximating minimizers of (1.1) towards the optimal ones. In particular, we are interested in the case where the points are identically distributed with a common law (where we recall that denotes the volume measure) and satisfies for some
[TABLE]
To the best of our knowledge, there are only few results on the asymptotic behavior of the transport map and they are so far limited to the case of i.i.d. uniform samples in the study of the semi-discrete matching problem (that is couplings between and ), see the work of Ambrosio, Glaudo and Trevisan in [4]. In connection with this work, quantitative estimates on the optimal map for the matching between the Lebesgue measure and Poisson clouds have been obtained by Goldman, Huesmann and Otto in [29] and Goldman and Huesmann in [28].
Our extension in this paper is fourfold: First, we look at more general distribution of points and we consider the case of general densities satisfying (1.6). Second, we do not assume independence and we consider samples which may possess correlations. Third, we do not restrict the analysis to the semi-discrete matching problem and we also investigate the ansatz for the full matching problem (1.1). Finally, we investigate the case where the points are not identically distributed and we extend our result to a class of Harris positive recurrent Markov chains.
We finally mention that the effectiveness of the linearization ansatz introduced in [16] is not only limited to the case of i.i.d. distributed points on bounded domains, but it can be employed in many different settings. See for instance [15] for an interesting application to the matching on unbounded domains, [35, 36, 37] for an application to Gaussian matching, [33] for an application in stochastic matrix theory, [58, 59, 60, 32] for an application to a continuous instance of the matching problem, i.e. when the empirical measure is replaced by the occupation measure of a stochastic process. It is worth to further mention that these techniques can also be employed when considering the matching problem with -costs in higher dimension, see [30].
1.2. Linearization ansatz
We now briefly reproduce the linearization ansatz introduced in [16]. For simplicity, we consider the case , and i.i.d. samples with common distribution . Let be an optimal transport map (whose existence is ensured by Brenier’s Theorem [14]) between and . Based on the transport relation and a change of variables, solves (formally) the Monge-Ampère equation
[TABLE]
Since the cost is quadratic, by [48, Theorem 1.25], there exists a function such that . Applying the law of large numbers, we further have the weak convergences as so that we expect as . Thus, this suggests that the correction is small as , allowing to perform (formally) the Taylor expansions
[TABLE]
Plugging (1.8) into (1.7), neglecting the higher order terms and replacing by yields
[TABLE]
This formal linearization suggests the following two conjectures
[TABLE]
Unfortunately, (1.10) cannot hold as it is, since the solution of (1.9) does not belong to due to the roughness of the source term. To overcome this, following the strategy in [6], a regularization using the heat-semigroup at time is made. Doing so, the first item of (1.10) turns out to be true, leading to the result (1.5) (see for instance [3] for a convergence rate).
1.3. Formulation of the main results
For the remainder of the paper denotes a -dimensional connected and compact Riemannian manifold without boundary (or the square ) endowed with the Riemannian distance . For we denote by the fundamental solution of the heat operator on , where denotes the Beltrami-Laplace operator. We define the heat semigroup via its action on probability measures and square integrable functions
[TABLE]
We first introduce the class of correlated point clouds that we consider for studying the matching problem (1.1). This class concerns point clouds for which the correlations between points decay at an exponential rate, where the correlations are measured in terms of the -mixing coefficients given by, for any
[TABLE]
and the -mixing coefficients given by222We denote by the law of a random variable .
[TABLE]
Assumption 1.1** (Correlated point clouds).**
We consider point clouds which are identically distributed according to where satisfies (1.6). We further assume decay of the correlations in the form of
[TABLE]
and there exist and such that
[TABLE]
Our first main result concerns the approximation of transport plans coupling and defined in (1.2). We justify the formal linearization of the Monge-Ampère equation achieved in Section 1.2 in a annealed quantitative way (i.e. in expectation): We show that, a suitable regularization of, the plan \big{(}\text{Id},\exp(\nabla h^{n})\big{)}_{\#}\mu^{n}, with defined in (1.9), provides a good approximation when measuring the error with respect to the -Wasserstein distance in the product space endowed with the metric
[TABLE]
The density will need further regularity in form of fractional Sobolev spaces defined as, for some
[TABLE]
where denote the eigenvalues and eigenvectors of on and denotes the Fourier modes of . Finally, we denote by the -based Sobolev space
[TABLE]
Theorem 1.2** (Approximation of the transport plan).**
Let for some satisfying (1.6) and and be defined in (1.2) (for with some given increasing map ) with point clouds satisfying Assumption 1.1 and such that there exists for which . We consider333where we impose additional Neumann boundary conditions in the case the weak solution of
[TABLE]
for any with and .
There exist an exponent , a deterministic constant and a random variable both depending on and for which given and
[TABLE]
it holds
[TABLE]
where the runs over all optimal transport plans between and .
Furthermore, if (1.14) holds with , the assumption (1.13) can be dropped and it holds
[TABLE]
where the runs over all optimal transport plans between and .
Our second main result concerns the particular case of the semi-discrete matching problem, i.e. optimal coupling between the common law and . We know from McCann’s theorem [39] that there exists a unique optimal transport map , that is the optimal transport plan can be written as
[TABLE]
We show that can be approximated in a annealed quantitative way in by (a suitable regularized version of) the solution of (1.9) with replaced by .
Theorem 1.3**.**
Let for some satisfying (1.6) and be defined in (1.2) with a point cloud satisfying Assumption 1.1. We consider the weak solution of
[TABLE]
where, for all , we recall that and . Finally, we denote by the optimal transport map from to .
There exist an exponent , a deterministic constant and a random variable both depending on and for which given , it holds
[TABLE]
Furthermore, if (1.14) holds with , the assumption (1.13) can be dropped and it holds
[TABLE]
We finally mention that in the case where the eigenfunctions admit a uniform bound, the conclusions (1.21) and (1.24) can be improved. We comment on the proof at the end of Sub-section 3.5.
Remark 1.4**.**
Let and be as in Theorem 1.2. We assume that the family of eigenfunctions satisfies the uniform bound
[TABLE]
Then, (1.21) and (1.24) hold true for with a convergence rate with the same stochastic integrability. Note that (1.25) typically holds when the geometry of is flat, see [54].
Theorem 1.2 and Theorem 1.3 are not restricted to the case of identically distributed point clouds and we present in the next section and in Appendix C a possible extension, using the same techniques, to a class of regular discrete-time Markov chains.
1.4. Extension to a class of Markov chains
We first recall some basic facts on discrete-time Markov chains on . Such a Markov process is described by its initial distribution and its transition kernel , that is a measurable map from to the space of probability measures . We recall that acts on in form of
[TABLE]
and likewise on bounded measurable function in form of
[TABLE]
Given an initial distribution , we recall that the law of a Markov chain can be expressed with the help of the transition kernel, namely
[TABLE]
where stands for the -iteration of the kernel .
We now introduce the class of discrete-time Markov chains we consider.
Assumption 1.5**.**
Let be a -dimensional compact Riemannian manifold. Let and be a Markov chain with initial law . We assume that the chain satisfies the two following conditions:
- (i)
We assume that there exists a measurable function and such that for any Borel set
[TABLE]
- (ii)
We assume that there exists an unique invariant measure , i.e. , and , such that , as well as for which
[TABLE]
with
[TABLE]
We now comment on the consequences of the above assumptions. First, the condition (1.29) ensures that the invariant measure is absolutely continuous with respect to the volume measure with bounded density, namely
[TABLE]
We briefly give the argument for (1.31). Using the second item of (1.29), we have that the operator
[TABLE]
Furthermore, we note that the closed convex set is invariant under the action of . Therefore Schauder’s fixed point theorem implies that admits a fixed point in . Given such a fixed point , it is clear that defined in (1.31) is an invariant measure according to (1.29).
Second, we note that by Harris’ theorem [31, Theorem 3.7], the condition (1.30) is satisfied when the kernel satisfies the following geometric drift condition: There exist a function and constants and such that
[TABLE]
and the kernel is bounded on the sublevel sets of , i.e. for all , there exists a constant for which
[TABLE]
Moreover, the assumption (1.30) implies the geometric decay of the -mixing coefficient (1.12), namely there exists a constant depending on , and such that
[TABLE]
which ensures that (1.13) and (1.14) (with and ) hold and ensures good concentration property of the Markov chain, see Proposition A.1. The estimates (1.32) can be seen as a direct consequence of the combination of the representation for the -mixing in [21, Proposition 1] and the assumption (1.29).
Finally, the condition (1.30) quantifies the weak convergence of the law of the Markov chain to its stationary distribution, namely there exists a constant such that for any
[TABLE]
We shortly give the argument. We first notice that a direct inductive argument together with the semigroup property for every and Fubini’s theorem gives
[TABLE]
The combination of (1.28), (1.34) and (1.30) gives
[TABLE]
which leads to (1.33) using that and by Assumption 1.5 .
A classical example of a Markov chain satisfying Assumption 1.5 is given by iterated function systems with additive noise. For simplicity, let . Let be i.i.d. random variables with common law for some satisfying . Let be a contraction, i.e. there exists a constant such that
[TABLE]
We define the iterated function system according to the induction
[TABLE]
The kernel is given by
[TABLE]
so that satisfies (1.29) with
[TABLE]
Moreover, the condition (1.35) ensures the validity of (1.30), see for instance [2, Theorem 3.2]. Thus the Markov process satisfies Assumption 1.5.
We show in Appendix C that the conclusions of Theorem 1.3 and Theorem 1.2 hold true for Markov chains satisfying Assumption 1.5.
1.5. Open problems
We conclude this section with open questions that arise in view of our results:
- (1)
*Sharpness of the rates. *The convergence rate in (1.20) and (1.23) match with the one obtained for the case of uniformly distributed samples in [4]. However, even in the latter case, it has not been shown whether the rate is optimal and we suspect the opposite. A possible way to track the optimal rate could be to perform a second-order linearization of the Monge-Ampère equation (1.7). Following the same type of computations leading to (1.9) in the case , a second-order linearization should solve
[TABLE]
where we recall that solves (1.9), providing the conjecture
[TABLE]
This direction of research is left for future investigations. 2. (2)
*Extension to -costs. *A natural question is to investigate if our results hold for different cost functions as -cost functions for . The behavior of the cost has been optimally quantified in [1, 13, 9, 23]. However, to the best of our knowledge, quantitative estimates on the transport plan in the setting of general -costs are not known, even for uniformly distributed samples. A possible approach would be to revise the linearization ansatz of [16] for general -costs. As observed in [34], if the transport cost between two points is given by , Gangbo-McCann’s theorem [25, Theorem 1.2] ensures that there exists a map such that the optimal transport map takes the form , where denotes the conjugate exponent. Therefore, following the same type of computations leading to (1.9), a first-order linearization should solve the following degenerate -Laplace equation
[TABLE]
and we may expect
[TABLE]
2. Structure of the proof
This section is devoted to describe the main ideas and how are organized the proofs of Theorem 1.2 and 1.3. We mainly focus on the proof of Theorem 1.2 since the proof of Theorem 1.3 follows by the same strategy.
General strategy.
The proof of Theorem 1.2 follows the strategy employed in [4] to deal with independent and uniformly distributed random points. The main idea is to use the quantitative stability result for transport maps in [4, Theorem 3.2], stating that two transports map are close in the -topology if the target measures are close in the -topology. We restate below the result for reader’s convenience.
Theorem 2.1** (Stability of transport maps).**
Let such that and let be the optimal transport maps respectively for the pairs of measures and . We assume that for some with -regularity.
There exists a constant depending on such that, provided
[TABLE]
we have
[TABLE]
The first step consists of using Theorem 2.1 to deduce a stability estimate (in terms of the quadratic Wasserstein distance) of transport plans in the special case where , and . In this step, we immediately face the issue of the lack of regularity of necessary to ensure the condition (2.1): Indeed, recalling that solves (1.18), it does not have the -regularity condition for non-smooth densities that we consider here. We overcome this issue introducing an additional regularization step: We smooth the operator and implicitly in form of
[TABLE]
for a regularization parameter to be optimized and . Classical Schauder’s theory ensures that owns -regularity. Doing so, we can use Theorem 2.1 to deduce, provided that
[TABLE]
a stability error estimate which reads
[TABLE]
where we refer to (3.107) for further details. Our argument then differs from [4] by splitting the error in two parts
[TABLE]
Our proof then proceeds in two steps, controlling separately the two terms in (2.5).
Control of the regularization error
To deal with the regularization error, we look at the difference which solves, according to (1.18) and (2.2),
[TABLE]
Using an energy estimate, we get
[TABLE]
On the one hand, since , we have as in every with . On the other hand, we learn from Meyers’ estimate (recalled in Proposition A.3) that there exists such that . Consequently, we can treat (2.7) using Hölder’s inequality which provides
[TABLE]
The next step is to control the averaged Meyers’ norm \mathbb{E}\big{[}\|\nabla h^{n,t}\|^{2}_{\mathrm{L}^{\bar{q}}}\big{]}, that we show in Proposition 3.3 to be of order of
[TABLE]
where we recall that denotes the correlation length, see Assumption 1.1. The combination of (2.8), (2.9) and local Lipschitzianity of the exponential map yields
[TABLE]
where we refer to (3.104) for further details.
Control of the stability error
For the stability error, we first need to ensure (2.3). Our strategy follows the idea in [3] which consists of showing that (2.3) is satisfied with very high probability. In our case, a new difficulty comes from our regularization of and the regularization parameter has to be carefully optimized. We show that if is taken as an inverse power of , (2.3) becomes very likely as . More precisely, we show in Proposition 3.4 that given two exponents and , there exists such that given the choices
[TABLE]
we have
[TABLE]
This result is in the spirit of [3, Theorem 3.3] but, in our setting, the proof relies on Schauder’s theory rather than an explicit formula for as well as concentration inequalities in form of Proposition A.1 to treat the correlations. For further details on the strategy, we refer to Section 3.3. With (2.12) in hands, we can restrict the analysis to realizations satisfying where, for , (2.3) is satisfied which puts us in the validity of (2.4). We then treat each terms appearing in (2.4) separately:
- •
The optimal control of the cost has been already well studied and is optimally estimated by
[TABLE]
We refer to Appendix B for a detailed statement, references and extensions to the cases of Assumption 1.1 and Assumption 1.5.
- •
The smoothing errors and . Classical contractivity estimates are known and are usually applied to deal with these errors, see for instance [22, Theorem 3], which bound the errors by . However, due to the choice of in (2.11), this result is of no use since is much larger than the magnitude of the cost, namely . Instead, we follow the approach in [3], where the authors showed that in the particular case of empirical measures in dimension , we can improve the rate and obtain the bound . We extend this result to our setting of non-constant densities and correlated points. In Proposition 3.5, we derive
[TABLE]
As opposed to [3], our approach uses Fourier analysis together with additional cares to handle the correlations and non-constant densities.
- •
The error in the Moser coupling W^{2}_{2}\big{(}\nu^{m,t},\exp(\nabla h^{n,t}_{\delta})_{\#}\mu^{n,t}\big{)}. We follow the strategy in [3]. This error can be related to a Moser coupling between and (see for instance [56, Appendix p. 16]): The equation (1.18) gives a natural coupling between and which can be formulated using Benamou-Brenier’s theorem [10],
[TABLE]
Then, using the transport plan \big{(}\phi(1,\cdot),\exp(\nabla h^{n,t}_{\delta})\big{)}_{\#}\mu^{n,t} as a competitor, we get
[TABLE]
that we combine with a quantitative stability result for flows of vector fields, proved in [3, Proposition A.1], leading to
[TABLE]
where we recall that denotes the Meyers’ exponent introduced in (2.7). For further details, we refer to (3.115). It then remains to appeal to Meyers’ estimate, see Proposition A.3, to (2.6) together with (2.9) in form of
[TABLE]
which finally yields
[TABLE]
To conclude, we see that all bounds involve errors in terms of the approximation of using the heat-semigroup, that we need to quantify. This is where the assumption plays a role, in form of the quantitative estimate
[TABLE]
see (3.94) for a proof. Combining (2.4), (2.5), (2.10), (2.13), (2.14), (2.15), (2.16) with the choices of and in (2.11), we obtain Theorem 1.2. The proof of Theorem 1.3 is obtained using the same strategy where the first step is simpler, since we apply directly Theorem 2.1 with , and where solves .
3. Proofs
3.1. Notations and preliminary results
We provide in this section some notations and preliminary results needed in the proofs of Theorem 1.2 and Theorem 1.3. We recall that throughout the paper, we denote by a -dimensional compact connected Riemannian manifold (or the square ) endowed with the Riemannian distance .
**Wasserstein distance. **Given , we define the quadratic Wasserstein distance as
[TABLE]
where is the set of couplings between and , that is the set of having and as first and second marginal, respectively. We refer the reader to the monographs [55, 56] for a detailed overview on the subject of optimal transport. We recall the following simple, but useful Lipschitz contraction property of the Wasserstein distance.
Lemma 3.1** (Lipschitz property of the Wasserstein metric).**
Let be a complete and separable metric space, let and let be a -Lipschitz map. It holds
[TABLE]
Proof.
For any coupling , the push-forward is a coupling between and . Moreover, it holds
[TABLE]
Taking the infimum among all possible couplings leads to (3.2). ∎
**Heat semigroup and heat kernel. **We recall some basic facts on the heat semigroup and its generator, we refer the reader to [18, Chapter VI] for a more detailed overview. For , we denote by the fundamental solution of the heat operator on , where denotes the Beltrami-Laplace operator. Classical Schauder’s theory ensures that is smooth and it is known, see for instance [52] and [3, Appendix B], that and its derivatives satisfy for some depending on
[TABLE]
The kernel admits the spectral decomposition
[TABLE]
converging in , where we recall that denotes the eigenvalues and eigenvectors of on . Specifying (3.4) on the diagonal and using , we obtain the trace formula
[TABLE]
We recall that can be estimated in terms of the eigenvalues,
[TABLE]
We briefly recall the argument. Applying the Gagliardo-Nirenberg’s interpolation inequality [7, Theorem 3.70], it holds
[TABLE]
In combination with and elliptic regularity, in form of
[TABLE]
we obtain (3.6).
We recall that admits the spectral gap property, that is there exists a constant such that
[TABLE]
Note that equivalently, (3.7) can be formulated in terms of the eigenvalues in form of
[TABLE]
simply by specifying (3.7) on . Finally, we recall the Riesz-transform bound
[TABLE]
where can be defined via its spectral representation
[TABLE]
with the inner product in . We refer to the monograph [57] for a discussion of the inequalities (3.7) and (3.9), see Chapter 1 for the case of a Riemannian manifold without boundary and Chapter 2 for the case of a Riemannian manifold with (convex) boundary. In connection with the Wasserstein metric, the heat semigroup satisfies the following classical contraction property.
Lemma 3.2** (Semigroup contraction for absolutely continuous measures).**
Let satisfy (1.6). Given , it holds
[TABLE]
Proof.
Using defined via together with (1.6), [3, Corollary 4.4] yields
[TABLE]
Writing together with gives (3.11). ∎
3.2. -type estimates
As we have seen in (2.8), we need a sharp control of the averaged Meyers’ norm \mathbb{E}\big{[}\|\nabla h^{n,t}\|^{2}_{\mathrm{L}^{\bar{q}}}\big{]}. This will be obtained as an immediate corollary of the following proposition, for more details see (3.101).
Proposition 3.3** (-estimates).**
Let be defined in (1.2) with point clouds satisfying Assumptions 1.1. Let be the Meyers exponent given in Theorem A.3 for the operator . The solution444with Neumann boundary conditions in case has a boundary of
[TABLE]
satisfies:
[TABLE]
and a random variable satisfying for some generic constant depending on ,
[TABLE]
Furthermore, if (1.14) holds with then the assumption (1.13) can be dropped and the stochastic integrability can be improved up to losing a factor, namely
[TABLE]
and a random variable satisfying for some generic constant depending on ,
[TABLE]
Proof.
We proceed in four steps. In the first step, we prove a representation formula for that we will use as the core tool in the next steps. In the second step, we compare the two operators and , with help of Meyers’ estimate recalled in Theorem A.3. Doing so, we then have to bound the -norms () of the gradient of the solution555which belongs to any for any from Calderón-Zygmund’ theory, see for instance [26] to the Poisson equation with r.h.s. and Neumann boundary conditions. We control all the norms by the -norm that, in turn, we estimate using the Riesz-transform bound (3.9) and following some ideas from [6, Lemma 3.17]. In the third and fourth steps, we control the bound previously obtained in expectation where our main tool is Assumption 1.1 and the concentration inequalities in Proposition A.1.
Step 1. A representation formula for . We show that given such that on we have
[TABLE]
Note that , defined in (3.10), is well defined in . Indeed, using the fact that and (3.8), we have for any
[TABLE]
which vanishes as uniformly in .
We now justify (3.16). Observe that since on ,
[TABLE]
which is a direct consequence of two integration by parts using the heat-kernel representation . Therefore
[TABLE]
where the last integral is well-defined in since from (3.7)
[TABLE]
We then use the spectral decomposition of the heat semigroup (3.4) to get
[TABLE]
The combination of (3.18) and (3.19) yields for any
[TABLE]
Using (3.8), we have
[TABLE]
so that we can exchange integration and summation in (3.20) to obtain
[TABLE]
which gives (3.16) by arbitrariness of . Finally, note that the r. h. s. integral in (3.16) is absolutely convergent thanks to the integration by parts and the bounds on the heat kernel (3.3), so that it defines a function in .
Step 2. Comparison with the solution of the Poisson equation. We claim that for any and
[TABLE]
Let be the solution of the following Poisson equation
[TABLE]
Re-expressing the right-hand side of (3.12) as , we apply Meyers’ estimate recalled in Theorem A.3 and Hölder’s inequality to obtain:
[TABLE]
We now introduce the Paley-Littlewood functional
[TABLE]
We recall that the inverse of is continuous, see [51], namely
[TABLE]
Combining the Riesz transform bound (3.9) with (3.24) yields
[TABLE]
We now claim that
[TABLE]
which requires a special care when has a boundary. We use the definition of in form of to get
[TABLE]
Recalling that , (3.17) implies that which, combined with (3.22) and (3.16), gives
[TABLE]
In particular, it implies that . Therefore, one can use once more (3.17) and, together with (3.28), (3.27) turns into
[TABLE]
Using a last time (3.17) in form of that we combine with the semigroup property yields
[TABLE]
which, together with (3.29) and (3.16) leads to (3.26).
The combination of (3.23), (3.25) and (3.26) together with Minkowski’s inequality gives
[TABLE]
which is (3.21).
Step 3. Proof of (3.13). The estimate (3.13) is a consequence of (3.21) applied with and
[TABLE]
with
[TABLE]
Indeed, plugging (3.30) in (3.21) gives
[TABLE]
Using that
[TABLE]
and analogously
[TABLE]
We now show (3.30). First, using the definition (1.2) of , we have
[TABLE]
such that expanding the square gives
[TABLE]
The estimate (3.30) is then a consequence of
[TABLE]
Indeed, the first item of (3.34) immediately implies
[TABLE]
while, using the assumption (1.14) and that ,
[TABLE]
It remains to prove (3.34) and we start with the first item. Here, we use the fact that
[TABLE]
This can be seen from (3.10): Using that is an auto-adjoint operator in and that from (3.19) we learn , we have
[TABLE]
Hence, using the semi-group property , we deduce
[TABLE]
We now bound in two different ways. First, using the bounds (3.3) of the heat-kernel, we have by the triangle inequality
[TABLE]
yielding to the first alternative in the first item of (3.34). Second, applying Poincaré’s inequality yields
[TABLE]
yielding to the second alternative in the first item of (3.34).
We now turn to the second item of (3.34). Here, we make use of the representation formula (3.16) applied to . Using the semi-group property , this takes the form
[TABLE]
A direct application of the heat-kernel bounds (3.3) leads to
[TABLE]
which is the first alternative in the second item of (3.34). For the second alternative, we write
[TABLE]
so that, using (3.3),
[TABLE]
Step 4. Proof of (3.15). Following the same computations done in the previous step, the estimate (3.15) is a consequence of (3.21) and the moment bounds
[TABLE]
together with the second item of (3.34) and Lemma A.2, where we recall that is defined in (3.31).
We now show (3.37). Using (3.33) and the assumption , we apply the concentration inequality in Proposition A.1 to the effect of: for any
[TABLE]
with
[TABLE]
We then obtain (3.37) combining (3.38) with (3.34) and (3.35), together with an application of the Layer-cake formula.
∎
3.3. Fluctuation estimates
This section is devoted to justify (2.12) needed to ensure the condition (2.3) with very high probability. Our result is in the spirit of [3, Theorem 3.3]. However, our strategy differs from [3, Theorem 3.3] and is based on Schauder’s theory, with an additional special care on the dependences on . We briefly sketch the main ingredients of the fluctuation estimates (2.12). By linearity, it is enough to show (2.12) for being the solution of
[TABLE]
We then make use of the chain rule to expand the equation in
[TABLE]
and we define the auxiliary problem
[TABLE]
such that the difference solves . Doing so, on the one hand, we can control which can be handled using the explicit formula in terms of the heat-kernel, the explicit bounds on the latter, cf (3.3), and the regularity of . On the other hand, we use Schauder’s estimates to control and . Using the fact that those estimates depend polynomially on , we can keep track on the dependences on that we can optimize later on. We finally mention that in the case where has a boundary, cannot be directly defined by (3.41) since the r. h. s. does not have zero mean. In order to also include this case, we add a zero order term in the equation, see (3.42).
Proposition 3.4** (Fluctuation estimates).**
Let be defined in (1.2) with point clouds satisfying Assumption 1.1. For any parameter and , we define666with Neumann boundary conditions in case has a boundary weak solution of
[TABLE]
and the two events
[TABLE]
There exists such that for any and the choice
[TABLE]
the solution of (3.39) satisfies
[TABLE]
Furthermore, there exists depending on such that for the choice , we have
[TABLE]
Proof.
The proof of Proposition 3.4 is split into two steps. In the first step, we prove (3.45) where our main tool is Schauder’s theory and an explicit formula for defined in (3.40). In the second step, we show (3.46), where our main tool is the concentration inequalities in Proposition A.1 and the explicit formula for used in the first step.
Step 1. Proof of (3.45). We define the difference v^{n,t}_{\delta}:=f^{n,t}_{\delta}-\Big{(}u^{n,t}_{\delta}-\int_{\mathcal{M}}u^{n,t}_{\delta}\Big{)}\in\dot{\text{H}}^{1} and note that from (3.40) and (3.42), it solves
[TABLE]
We claim that there exists such that with the choices of in (3.44), we have
[TABLE]
The estimate (3.45) then follows from (3.48) and the triangle inequality.
We now prove (3.48). We apply Schauder’s estimate (see for instance [27] and [45, Chapter 10]) to (3.47) to obtain
[TABLE]
While the second r. h. s. term is directly of order of in , the first r. h. s. term requires additional attention. Using (1.6) and (3.3), satisfies
[TABLE]
and together with the algebraic property of , we have
[TABLE]
The latter is bounded using Schauder’s estimate applied this time on (3.39) (knowing that the dependence on is at most polynomial): there exists such that
[TABLE]
which yields the following control of the first r. h. s. term of (3.49)
[TABLE]
which is of order of in .
Step 2. Proof of (3.46). We provide the arguments for (3.46) in case that (1.14) holds for and the event that we reduce to , the other cases as well as the case of follow by a straightforward adaptation. The estimate (3.46) is a consequence of
[TABLE]
for some constants . To see this, let be defined by
[TABLE]
By compactness of , we can find a -net with . We note that
[TABLE]
Indeed, if for any , then for any there exists such that
[TABLE]
Applying on (3.54) yields
[TABLE]
Using (3.52) and
[TABLE]
which can be proven following the arguments leading to the second item of (3.59) below, this yields for any for the choice .
We now prove (3.52). We first exploit the following explicit representation formula777a simple change of variable gives that the kernel associated to is given by for ,
[TABLE]
that we expand, using the definition (1.2) of , in form of
[TABLE]
Then applying the concentration inequalities in Proposition A.1, we get
[TABLE]
where
[TABLE]
The estimate (3.52) then follows from the three following estimates
[TABLE]
that we prove separately in the next three sub-steps.
Sub-step 2.1. Proof of the first item of (3.59). Splitting the time integral into and subtracting and adding back in the first integral as well as using the semigroup property of in form of
[TABLE]
we decompose into a regular-part and a singular-part :
[TABLE]
For the regular-part , we apply directly the heat-kernel bounds (3.3) and the first item of (3.50), to obtain from the triangle inequality and Minkowski’s inequality
[TABLE]
The first r. h. s. term is dominated using directly the heat-kernel bounds (3.3) and (3.50)
[TABLE]
For the second r. h. s. side term , we first simplify the -integral. Using that
[TABLE]
we have by Jensen’s inequality and the heat-kernel bounds (3.3)
[TABLE]
Thus,
[TABLE]
The combination of (3.61), (3.62) and (3.63) yields
[TABLE]
We now turn to the singular-part . We first apply Minkowski’s inequality in form of
[TABLE]
We then simplify the -integral. To this aim, we bound the integrand in using the heat-kernel bounds (3.3), (3.50) and
[TABLE]
in form of
[TABLE]
This yields together with (3.66)
[TABLE]
To conclude, the combination of (3.60), (3.65) and (3.69) shows the first item of (3.59).
Sub-step 2.2. Proof of the second item of (3.59). We use the decomposition (3.60). For the regular-part , we argue as in (3.61) for the first term whereas the second-term is estimated using the heat-kernel bounds (3.3) in form of
[TABLE]
so that
[TABLE]
Hence,
[TABLE]
For the singular-part , we use the bound (3.68) which directly yields
[TABLE]
The combination of (3.60), (3.70) and (3.71) gives the second item of (3.59).
Sub-Step 2.3. Proof of the third item of (3.59). According to the first item of (3.59), it suffices to give the argument for the second term in the definition (3.58) of . We use the assumption (1.14) together with the two first items of (3.59) in form of
[TABLE]
which concludes since .
∎
3.4. Contractivity estimates
This section is devoted to the control of the smoothing errors and for the particular choice of given in Proposition 3.4. The first result is in the spirit of [3, Theorem 5.2] that we extend in the case of non-uniformly distributed and correlated points. This extension requires a finer analysis of the error and the proof relies on Berry-Esseen type inequalities in the spirit of [12, Theorem 5].
Proposition 3.5** (Semigroup contraction for empirical measures).**
Let be defined in (1.2) with point clouds satisfying Assumption 1.1. Given such that Proposition 3.4 holds, we have
[TABLE]
for some random variable satisfying for
[TABLE]
Furthermore, if (1.14) holds with then the assumption (1.13) can be dropped and the stochastic integrability can be improved up to losing a factor, namely
[TABLE]
for some random variable satisfying for
[TABLE]
Proof.
According to the fluctuation estimates in Proposition 3.4 together with , we can restrict the analysis in defined in (3.43). Note that for large enough, (1.6) yields
[TABLE]
We split the proof into three steps. In the first step, we prove a Berry–Esseen type smoothing inequality for which decomposes the error in a deterministic part involving and a random part involving the Fourier coefficients of . In the second step, we prove (3.72). In the third step, we control the fluctuations of using the concentration inequalities in Proposition A.1 and deduce (3.73).
Step 1. Berry-Esseen type inequality. Recalling that we denote by the eigenvalues and eigenfunctions of respectively, we prove that
[TABLE]
where
[TABLE]
We first apply the triangle inequality and use the classical contractivity estimate in [22, Theorem 3] to get
[TABLE]
We then apply Peyre’s estimate [46] to the second r. h. s. , which takes the form
[TABLE]
Now, given an arbitrary such that
[TABLE]
we split
[TABLE]
For the first r. h. s. term of (3.79), we expand the integral using (3.4). Thus, together with the semigroup property of and Cauchy-Schwarz’s inequality, we get
[TABLE]
Using that from (3.74) we have and recalling (3.78), we get
[TABLE]
Furthermore, noticing that which implies that, since is self-adjoint
[TABLE]
we obtain
[TABLE]
This leads to
[TABLE]
For the second r. h. s. of (3.79), we introduce satisfying
[TABLE]
so that from an integration by parts, Cauchy-Schwarz’ inequality and the combination of (3.74) and (3.78), we obtain
[TABLE]
Using then the explicit formula together with , we get
[TABLE]
so that
[TABLE]
The combination of (3.79), (3.80), (3.81) and (3.76) leads to (3.75).
Step 2. Proof of (3.72). According to (3.75), it remains to show that
[TABLE]
Writing
[TABLE]
we first expand the square in form of
[TABLE]
For the first r. h. s. term of (3.84), we use the normalisation together with (1.6) to the effect of
[TABLE]
and get
[TABLE]
For the second r. h. s. term of (3.84), we use the definition of the -mixing coefficient (1.12) together with the assumption (1.13) in form of
[TABLE]
The combination of (3.84), (3.86) and (3.87) yields
[TABLE]
It remains to show that
[TABLE]
We only treat the second l. h. s. term of (3.88), the first term is controlled the same way. For any , we expand
[TABLE]
We then disintegrate using the spectral decomposition of the heat kernel (3.4) in form of
[TABLE]
so that we obtain
[TABLE]
Step 3. Proof of (3.73). It is a consequence of the following fluctuation estimates
[TABLE]
together with Lemma A.2. Indeed, applying Minkowski’s inequality followed by (3.89) and yield
[TABLE]
and (3.73) follows from
[TABLE]
which is obtained the same way as in (3.88) using additionally the trace formula (3.5).
We now prove (3.89). It follows from the estimate on the probability tails
[TABLE]
for some , together with a simple application of the layer-cake representation.
To see (3.91), we use (3.83) together with Proposition A.1 to obtain
[TABLE]
with
[TABLE]
The estimate (3.91) is then a consequence of
[TABLE]
The first item of (3.93) has been treated in (3.6). For the second item of (3.93), we use (3.85) and, combined with (1.14), we obtain
[TABLE]
∎
3.5. Proof of Theorem 1.2: Approximation of the transport plan
We only give the arguments for (1.20), (1.21) is proved the same way using the corresponding results (3.15), (3.73) and (B.2) in the case (where some additional comments are given if necessary along the proof). We split the proof into four steps. In the first step, we display some preliminary estimates useful all along the proof. In the second step, we deal with the approximation error that occurs in the process of regularizing into . In the third step, we estimate the -distance for the regularized quantity using the quantitative stability result in [4, Theorem 3.2], splitting the estimates in small pieces that we control in the fourth step. We finally comment on the proof of Remark 1.4 and Theorem 1.3, which are obtained with similar techniques.
Step 1. Preliminary estimates.
**Heat kernel regularization. **The assumption provides
[TABLE]
Indeed, using the definition of the heat-kernel, Minkowski’s inequality and the spectral decomposition (3.4), we have
[TABLE]
Noticing that
[TABLE]
we get that
[TABLE]
**-estimates. **Let and , where is given in Proposition 3.4. For the given choices
[TABLE]
provided in Proposition 3.4, we define the weak solution of
[TABLE]
Note that by linearity, one can decompose with
[TABLE]
so that, considering as in (3.42) and likewise with replaced by and defining
[TABLE]
as well as
[TABLE]
we deduce from Proposition 3.4 and that
[TABLE]
**-estimates. **A similar decomposition as in (3.97) of (1.18) together with (3.13) and the choice of in (3.95) yields
[TABLE]
where denotes, all along the proof, a random variable which satisfies (3.14) and may change from line to line.
**-regularization error. **Note that from (3.96) and (1.18)
[TABLE]
so that from an energy estimate, Hölder’s inequality, (3.101) and (1.6), we obtain
[TABLE]
where denotes the Meyers’ exponent of the operator , see Theorem A.3.
Finally, since and (3.46) holds, we can restrict our analysis in that we do for the rest of the proof.
Step 2. Regularization error. We show that (3.103) survives when measuring the -distance, namely
[TABLE]
Using the coupling \big{(}(\mathrm{Id},\exp(\nabla h^{n,t}_{\delta})),(\mathrm{Id},\exp(\nabla h^{n,t})\big{)}_{\#}\mu^{n,t} as a competitor in (3.1) and the fact that in , we have
[TABLE]
We then claim that
[TABLE]
which, combined with (3.105) and (3.103) yields (3.104).
We now justify (3.106). The difficulty arises from the fact that is not globally Lipschitz. To overcome this, we define
[TABLE]
for a given fixed later, and we split
[TABLE]
For the first right-hand side integral, note that from the choice of and (3.103), we can choose uniformly in such that in the quantity can be made arbitrary small. Since is Lipschitz-continuous in a neighborhood of the null vector, we deduce
[TABLE]
For the second right-hand side term, we simply apply Markov’s inequality in form of
[TABLE]
The combination of the two previous estimates gives (3.106).
To prove (1.21), we need to control arbitrary -moments, according to Lemma A.2. The argument above can be easily adapted in this case by considering
[TABLE]
We then follow the same argument, choosing .
Step 3. Quantitative stability. We show that
[TABLE]
where we recall that is defined in (3.104).
Let be a coupling between and . We introduce a regularization parameter and, smoothing the measure into , the optimal transport plan from to is represented by a transport map , according to McCann’s theorem [39], that is
[TABLE]
We then apply the triangle inequality in form of
[TABLE]
First, using (3.100), is Lipschitz-continuous and can be made as small as possible for large. Since is Lipschitz-continuous in a neighborhood of the null vector, we learn from Lemma 3.1 that
[TABLE]
Second, we build a competitor for the second right-hand side term of (3.108): Defining
[TABLE]
we have
[TABLE]
Using again (3.100) we can apply, for large , the quantitative stability result of transport maps, Theorem 2.1, to , and to the effect of
[TABLE]
which turns into, using the triangle inequality,
[TABLE]
The combination of (3.108), (3.109) and (3.110) yields
[TABLE]
Since , and consequently (up to extracting a subsequence) , for some optimal transport plan , according to the qualitative stability result [56, Theorem 5.20], we can pass to the limit as in (3.111) which leads to (3.107).
Step 4. Proof of (1.20). We now fix such that, applying (3.94), the regularization error (3.104) turns into, recalling that is given by (3.95),
[TABLE]
It remains to show that
[TABLE]
which together with (3.94) and (3.112) leads to (1.20). To show (3.113), we control each terms of (3.107) separately.
The three last terms are controlled using the contractivity estimate (3.72) and (B.1) which gives
[TABLE]
For the first two terms, we argue that
[TABLE]
which combined with (B.1) leads to (3.113).
Let us define the curve and note that from (1.18) we have
[TABLE]
Applying Benamou-Brenier’ theorem [10], we learn that
[TABLE]
Next, using that
[TABLE]
and applying [3, Proposition A.1] together with Hölder’s inequality yields
[TABLE]
Using Meyers’ estimate of Proposition A.3 to (3.102) together with (1.6) and (3.101) provides
[TABLE]
which, combined with (3.115), yields (3.114).
We finally point out that, in the case , we use (3.73) and (B.2) and the same computations lead to (1.21).
Step 5. Proof of Theorem 1.3 and Remark 1.4. The proof of Theorem 1.3 follows the same strategy with the main difference that Step 3 is now dropped and Theorem 2.1 is directly applied with , and where solves
[TABLE]
The improvement of Remark 1.4 follows from the improved contractivity estimate (3.73): Under the assumption 1.25, we have (keeping the notations as in Proposition 3.5)
[TABLE]
i.e. we do not have the loss in (3.73). Inspecting the proof of (3.73), the loss comes from estimating defined in (3.92). We obtain (3.116) by simply using (1.25) and (1.11) to upgrade the second item of(3.93) into
[TABLE]
Appendix A Probabilistic and PDE tools
This section is devoted to recall some probabilistic and analytical tools needed in the proofs. We first recall some concentration inequalities for sequences of random variable satisfying Assumptions 1.1. Originally proved for i.i.d. samples, see for instance [19, Theorem 3.6 & 3.7], the proofs in the correlated case can be found in [42, Theorem 1] and [41, Theorem 2].
Proposition A.1**.**
Let , , be a family of centred random variables such that for which (1.14) holds.
For any , it holds for some constants depending on , :
- (i)
If ,
[TABLE]
with
[TABLE]
- (ii)
If ,
[TABLE]
We then recall the link between algebraic moments and exponential moments. The proof is a direct consequence of the Taylor expansion of the exponential function.
Lemma A.2**.**
Let be a non-negative random variable. The following two statements are equivalent:
- (i)
There exists such that
[TABLE]
- (ii)
There exists such that
[TABLE]
We conclude this section by recalling the standard Meyers’ estimate for elliptic equations in divergence form, see for instance the original paper [43].
Theorem A.3** (Meyers estimate).**
Let be measurable and uniformly elliptic. Consider the solution of the Neumann boundary problem
[TABLE]
for some with . There exists such that
[TABLE]
Appendix B Matching cost for point clouds
This section is devoted to recall the upper bounds on the matching cost, results which can be found in [12, Theorem 2] under mild -mixing conditions. The case of Markov chains have been studied in [47, 23] where sharp upper bounds are obtained. We include a short proof for convenience.
Proposition B.1** (Matching cost).**
Let satisfying (1.6) and be defined in (1.2) with points cloud satisfying the Assumptions 1.1 or in the class of Markov chains satisfying the Assumptions 1.5. There exists a constant such that
[TABLE]
Furthermore, if (1.14) holds with then the assumption (1.13) can be dropped and the stochastic integrability can be improved up to losing a factor, namely
[TABLE]
Proof.
Note that the proof of (B.1) can be found in [12, Theorem 2] when the point cloud satisfies the Assumptions 1.1. We first show how (B.1) can be extended to point clouds which are sampled from a Markov chain satisfying the Assumptions 1.5. Second, we show how the stochastic integrability can be improved to (B.2) when (1.14) holds with .
Step 1. Markov chains case. Recall that a Markov chain satisfying the Assumptions 1.5 admits an absolutely continuous invariant measure of the form with satisfying (1.6), that is . Recalling that we denote by the set of eigenvalues and normalized eigenfunctions of the Laplace-Beltrami operator on , we have by definition (1.2) of , for any
[TABLE]
where we use interchangeably the notation . Using the Berry-Esseen smoothing inequality [12, Theorem 5] together with (B.3), we get
[TABLE]
We now estimate the last two terms of (B.4) separately and we start with the third one. Using (1.33) and (3.93), we have
[TABLE]
where we recall that . Thus, using in addition (3.5), we get
[TABLE]
We now turn to the second term of (B.4). Expanding the square provides
[TABLE]
We now estimate the two terms on the right hand side of (B.6). For the first term, an easy induction argument combining (1.29) and (1.28) show that for any , with . Therefore, we have
[TABLE]
and we deduce
[TABLE]
For the second term, we use (1.32) to obtain
[TABLE]
Combining the latter with (B.4), (B.5), (B.6) and (B.7) yields
[TABLE]
We finally conclude similarly as for (3.88).
Step 2. Higher stochastic integrability. We now prove (B.2). We argue using the moment estimate (3.89) which, together with Minkowski’s inequality and implies
[TABLE]
Finally, combining the latter with the Berry-Esseen smoothing inequality [12, Theorem 5] and arguing similarly as for (3.88) yields (B.2) thanks to Proposition A.2. ∎
Appendix C Proof for the class of Markov chains
We provide in this Section the arguments for extending Theorem 1.2 and Theorem 1.3 to the class of Markov chains introduced in Section 1.4. The proof follows the lines of the proof of Theorem 1.2, where the main difference is that we drop the assumption that the point clouds is identically distributed. That affects the proofs of the main ingredients (we recall that the scaling of the cost has already be proven in Proposition B.1), namely the estimates in Proposition 3.3, the fluctuation estimates in Proposition 3.4 and the contractivity estimates in Proposition 3.5. We show in the following how to adapt the proofs for a given Markov chain satisfying Assumption 1.5. In the following, we recall that denotes the unique invariant measure of the chain. We split the proof in three steps
Step 1. estimates. We have to understand the extra error term coming from the deviation of from . In view of (3.21), it is
[TABLE]
Using the definition (1.2) of , the convergence to equilibrium (1.33) applied to and the heat-kernel estimates (3.3), we have for any and
[TABLE]
so that, recalling ,
[TABLE]
Step 2. Fluctuation estimates. Here, the distribution of the Markov chain affects the concentration estimate (3.52). We show that, defining
[TABLE]
we have
[TABLE]
where the r.h.s can be estimated following the lines of the proof of (3.52). As before, we investigate the extra term coming from the deviation of from . The estimate (C.3) follows from
[TABLE]
We argue as in (3.60), decomposing into a regular-part and a singular part: for any
[TABLE]
To estimate the second r.h.s integral of (C.5), we use (3.68). For the first r.h.s integral, that we denote by , we use the definition (1.2) of , the convergence to equilibrium (1.33) and the heat-kernel bounds (3.3) to obtain
[TABLE]
Step 3. Contractivity estimate. Here, the law of the Markov chain affects the estimate (3.82). The extra error term coming from the deviation of from reads
[TABLE]
Using the definition (1.2) of and the convergence to equilibrium (1.33) applied with and the bound on the eigenfunctions (3.6), we have for any
[TABLE]
so that, using the trace formula (3.5) and the heat-kernel estimates (3.3), we deduce
[TABLE]
Acknowledgments
The authors warmly thank Lorenzo Dello Schiavo, Antonio Agresti and Martin Huesmann for useful discussions and fruitful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Ajtai, J. Komlós, and G. Tusnády. On optimal matchings. Combinatorica , 4:259–264, 1984.
- 2[2] G. Alsmeyer. On the harris recurrence of iterated random Lipschitz functions and related convergence rate results. Journal of Theoretical Probability , 16(1):217–247, Jan 2003.
- 3[3] L. Ambrosio and F. Glaudo. Finer estimates on the 2 2 2 -dimensional matching problem. Journal de l’École polytechnique—Mathématiques , 6:737–765, 2019.
- 4[4] L. Ambrosio, F. Glaudo, and D. Trevisan. On the optimal map in the 2 2 2 -dimensional random matching problem. Discrete and Continuous Dynamical Systems , 39(12):7291–7308, 2019.
- 5[5] L. Ambrosio, M. Goldman, and D. Trevisan. On the quadratic random matching problem in two-dimensional domains. Electronic Journal of Probability , 27:1–35, 2022.
- 6[6] L. Ambrosio, F. Stra, and D. Trevisan. A PDE approach to a 2-dimensional matching problem. Probability Theory and Related Fields , 173(1):433–477, 2019.
- 7[7] T. Aubin. Some nonlinear problems in Riemannian geometry . Springer Science & Business Media, 1998.
- 8[8] R. B. Bapat and T. E. S. Raghavan. Doubly stochastic matrices , page 59–114. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1997.
