Geometric Planted Matchings Beyond the Gaussian Model

Abstract

Abstract

ABSTRACT We consider the problem of recovering an unknown matching between a set of randomly placed points in and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution. We use matchings in random geometric graphs to derive minimax lower bounds for this problem that hold under great generality. Using these results we show that for a fixed , as long as the noise distribution has finite th moment, and both initial positions and noise have bounded continuous densities, the minimax rate for the problem scales as . Under the stronger assumptions that the tail of the noise is sub‐Gaussian, we show that the order of the number of mistakes made by an estimator that minimizes the sum of squared Euclidean distances is minimax optimal when is fixed and is optimal up to factors when . In the high‐dimensional regime we consider a setup where both initial positions and perturbations have independent sub‐Gaussian coordinates. In this setup we give sufficient conditions under which the same estimator makes no mistakes with high probability. We prove an analogous result for an adapted version of this estimator that incorporates information on the covariance matrix of the perturbations.