Hyperuniform and rigid stable matchings
Abstract
We study a stable partial matching of the (possibly randomized) -dimensional lattice with a stationary determinantal point process on with intensity . For instance, might be a Poisson process. The matched points from form a stationary and ergodic (under lattice shifts) point process with intensity that very much resembles for close to . On the other hand is hyperuniform and number rigid, quite in contrast to a Poisson process. We deduce these properties by proving more general results for a stationary point process , whose so-called matching flower (a stopping set determining the matching partner of a lattice point) has a certain subexponential tail behaviour. For hyperuniformity, we also additionally need to assume some mixing condition on . Further, if is a Poisson process then has an exponentially decreasing truncated pair correlation function.
Cite
@article{arxiv.1810.00265,
title = {Hyperuniform and rigid stable matchings},
author = {Michael Andreas Klatt and Günter Last and D. Yogeshwaran},
journal= {arXiv preprint arXiv:1810.00265},
year = {2020}
}
Comments
Pages: 35, Figures: 10, Supplementary Video: Zooming out of a Poisson point process and a hyperuniform and rigid stable matching, Supplementary Animations: Visualization of the mutual nearest neighbor matching algorithm and the construction of a matching flower, Second version: Some typos and minor inaccuracies have been corrected