SearcharxivSearch

arXiv subjects

Francesco Mattesini

Publications and source records attributed to Francesco Mattesini.

8 recordsLinked to original sources

Sharp Rates of MMD Empirical Estimation with Power Kernels

We establish quantitative rates of convergence for the empirical estimation of probability measures by means of the Maximum Mean Discrepancy (MMD) with power kernel $K_q(x,y) = -|x-y|^q$, $q \in (0,2)$. The resulting discrepancy is the classical \emph{energy distance} $$\mathcal E_q^2(\mu, \omega) = -\frac{1}{2}\iint_{\mathbb{R}^d \times \mathbb{R}^d} |x-y|^q \, d(\mu - \omega)(x)\, d(\mu - \omega)(y),$$ and we ask how fast the best $N$-point empirical approximation $\inf_{\mu_N \in \mathcal{P}^N}\mathcal{E}_q(\mu_N,\omega)$ decays as $N \to \infty$. Given a probability measure $\omega$ on $\mathbb{R}^d$ with compact support satisfying an Ahlfors regularity condition of exponent $\beta \in (0,d]$, we prove that the sharp two-sided bound $$\mathcal E_q(\mu_N, \omega) \asymp N^{-\frac{1}{2}\left(1 + \frac{q}{\beta}\right)}$$ holds both for the worst-case empirical measure $\mu_N$ (lower bound, holding for every configuration of $N$ points) and for an optimally chosen empirical measure $\mu_N$ (upper bound). This complements the qualitative consistency result of Fornasier and H\"utter \cite{fornasier2014consistency}, who proved narrow convergence of the minimizers of $\mathcal E_q^2(\cdot, \omega)$ over empirical measures without quantitative rates.

math.PR

Adapted Wasserstein Barycenters of Gaussian Processes

We study barycenters of filtered Gaussian processes in adapted Wasserstein space. The adapted Wasserstein distance refines classical optimal transport by requiring transport plans to respect the temporal flow of information, making it the natural metric for stochastic systems with filtration constraints, as in stochastic control, mathematical finance, and sequential decision problems. We prove that the \emph{unrestricted} barycenter problem for weighted Fr\'echet means of filtered Gaussian inputs admits a solution with Gaussian underlying law, representable as an enlarged filtered Gaussian process but not necessarily as an ordinary one. The problem decomposes into finitely many classical Bures--Wasserstein barycenter problems for the covariance contributions of the successive innovations. We then treat the \emph{restricted} problem, in which the barycenter is required to be an ordinary filtered Gaussian process, giving a rank and common-noise criterion for when the two problems agree, sufficient conditions for uniqueness, and first order optimality and regularity results. Under a martingale constraint we obtain an explicit solution via martingale projection and Bures--Wasserstein barycenters of the Gaussian increments. Beyond their intrinsic theoretical interest, our results provide a principled way to build representative models from collections of Gaussian stochastic systems, with applications to stochastic optimization, robust finance, and sequential statistical analysis.

math.PR

Concentration for random Euclidean combinatorial optimization

We prove concentration bounds for random Euclidean combinatorial optimization problems with $p$--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesperson problem in dimension $d\ge 3$, we obtain concentration at the natural energy scale $n^{1-p/d}$ for $1\le p<d^2/2$. Our method combines a Poincar\'e inequality with a robust geometric mechanism providing uniform bounds on the edges of optimizers. We also formulate a conjectural $p\!\to\!q$ transfer principle for the $p$--optimal matching which, if true, would extend the concentration range to all $p\ge 1$.

math.PR

From Combinatorics to Partial Differential Equations

The optimal matching of point clouds in $\mathbb{R}^d$ is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point process. There is a crucial dependance on dimension $d$, with $d=2$ being the critical dimension. This is revealed by adopting an analytical perspective, connecting e.\,g.~to Optimal Transportation. These short notes provide an introduction to the subject. The material presented here is based on a series of lectures held at the International Max Planck Research School during the summer semester 2022. Recordings of the lectures are available at https://www.mis.mpg.de/events/event/imprs-ringvorlesung-summer-semester-2022.

math.PR

There is no stationary $p$-cyclically monotone Poisson matching in 2D

We show that for $p>1$ there is no $p$-cyclically monotone stationary matching of two independent Poisson processes in dimension $d=2$. The proof combines the $p$-harmonic approximation result from \cite[Theorem 1.1]{koch23} with local asymptotics for the two-dimensional matching problem. Moreover, we prove a.s. local upper bounds of the correct order in the case $p>1$, which, to the best of our knowledge, are not readily available in the current literature.

math.PR

Annealed quantitative estimates for the quadratic 2D-discrete random matching problem

We study a random matching problem on closed compact $2$-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 $n$ and $m=m(n)$ of points, asymptotically equivalent as $n$ goes to infinity, the optimal transport plan between the two empirical measures $\mu^n$ and $\nu^{m}$ is quantitatively well-approximated by $\big(\mathrm{Id},\exp(\nabla h^{n})\big)_\#\mu^n$ where $h^{n}$ 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 $\alpha$-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.

math.PR

Wasserstein Asymptotics for the Empirical Measure of Fractional Brownian Motion on a Flat Torus

We establish asymptotic upper and lower bounds for the Wasserstein distance of any order $p\ge 1$ between the empirical measure of a fractional Brownian motion on a flat torus and the uniform Lebesgue measure. Our inequalities reveal an interesting interaction between the Hurst index $H$ and the dimension $d$ of the state space, with a "phase-transition" in the rates when $d=2+1/H$, akin to the Ajtai-Komlós-Tusnády theorem for the optimal matching of i.i.d. points in two-dimensions. Our proof couples PDE's and probabilistic techniques, and also yields a similar result for discrete-time approximations of the process, as well as a lower bound for the same problem on $\mathbb{R}^d$.

math.PR

There is no stationary cyclically monotone Poisson matching in 2d

We show that there is no cyclically monotone stationary matching of two independent Poisson processes in dimension $d=2$. The proof combines the harmonic approximation result from \cite{GHO} with local asymptotics for the two-dimensional matching problem for which we give a new self-contained proof using martingale arguments.

math.PR