A. Munk, L. A. Rodríguez Ramírez, F. Steimkamp

We develop a statistical framework to match finitely many objects modeled as metric measure spaces (mm-spaces). The method relies on the second lower bound (SLB) of the Gromov–Wasserstein distance, capturing differences in distributions of pairwise distances within each space. To distinguish objects, we define a surrogate SLB barycenter, explicitly computed from their distance distributions. For K spaces with n samples each, the statistic is efficiently computed in O(K·n²) operations. We establish its asymptotic distribution and finite-sample bounds, enabling statistical inference. Applications include an asymptotic test for pose-invariant discrimination and a classification approach using SLB barycenters. The methods are validated through simulations and applied to comparing protein domain structures using the SCOPe database.

Keywords: Gromov-Wasserstein, Optimal Transport, Second Lower Bound

Scheduled

GT Estadística no Paramétrica II: Contrastes no paramétricos
September 4, 2026  3:30 PM
Aula 29


Other papers in the same session

On an independence test for polyspherical data and its applications

V. Litvinoff Justus, E. García-Portugués, B. Ebner

Goodness-of-fit tests under dependent censoring

A. Lago, J. C. Pardo Fernández, I. Van Keilegom

Goodness-of-fit for distributions on metric spaces

D. Serrano, E. García-Portugués, I. Van Keilegom

RKHS-based specification for the regression function

M. Vidal García, I. Van Keilegom, R. Crujeiras, W. González-Manteiga


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.