The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime

Motivated by the problem of matching two correlated random geometric graphs, we study the problem of matching two Gaussian geometric models correlated through a latent node permutation. Specifically, given an unknown permutation π^* on 1,ldots,n and given n i.i.d. pairs of correlated Gaussian vectors Xπ^*(i),Yi in ℝd with noise parameter σ, we consider two types of (correlated) weighted complete graphs with edge weights given by Ai,j=langle Xi,Xj rangle, Bi,j=langle Yi,Yj rangle. The goal is to recover the hidden vertex correspondence π^* based on the observed matrices A and B. For the low-dimensional regime where d=O(log n), Wang, Wu, Xu, and Yolou [WWXY22+] established the information thresholds for exact and almost exact recovery in matching correlated Gaussian geometric models. They also conducted numerical experiments for the classical Umeyama algorithm. In our work, we prove that this algorithm achieves exact recovery of π^* when the noise parameter σ=o(d-3n-2/d), and almost exact recovery when σ=o(d-3n-1/d). Our results approach the information thresholds up to a operatornamepoly(d) factor in the low-dimensional regime.