Subadditivity and optimal matching of unbounded samples
Annales de la Faculté des sciences de Toulouse : Mathématiques · 2026
DOI: 10.5802/afst.1861 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annales de la Faculté des sciences de Toulouse : Mathématiques, 2026. Verfasst von Emanuele Caglioti und 3 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben.
Abstract (Originalsprache)
We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence for the whole range of power exponents p and dimensions d . Moreover we identify the exact prefactor when p ≤ d . We cover in particular the Gaussian case, going far beyond the currently known bounds. Our proof technique is based on approximate sub- and super-additivity bounds along a geometric decomposition adapted to some features of the density, such as its radial symmetry and its decay at infinity.
Zitieren
APA
Caglioti, E., Goldman, M., Pieroni, F., & Trevisan, D. (2026). Subadditivity and optimal matching of unbounded samples. Annales de la Faculté des sciences de Toulouse : Mathématiques. https://doi.org/10.5802/afst.1861
Vancouver
Caglioti E, Goldman M, Pieroni F, Trevisan D. Subadditivity and optimal matching of unbounded samples. Annales de la Faculté des sciences de Toulouse : Mathématiques. 2026. doi:10.5802/afst.1861
BibTeX
@article{Caglioti2026,
author = {Caglioti, Emanuele and Goldman, Michael and Pieroni, Francesca and Trevisan, Dario},
title = {Subadditivity and optimal matching of unbounded samples},
journal = {Annales de la Faculté des sciences de Toulouse : Mathématiques},
year = {2026},
doi = {10.5802/afst.1861}
}
EUVIMED