Asymptotic optimality of the triangular lattice for a class of optimal location problems
David P. Bourne, Riccardo Cristoferi

TL;DR
This paper proves that, in the limit of many particles, the triangular lattice configuration is asymptotically optimal for a class of particle approximation problems involving the 2-Wasserstein metric, with applications in economics and signal processing.
Contribution
It extends crystallization results to a broader class of particle systems, establishing the asymptotic optimality of the triangular lattice in optimal location problems.
Findings
Triangular lattice is asymptotically optimal for best approximation of measures.
Results generalize previous crystallization findings to new particle systems.
Optimal configurations with near-minimal energy are geometrically close to a triangular lattice.
Abstract
We prove an asymptotic crystallization result in two dimensions for a class of nonlocal particle systems. To be precise, we consider the best approximation with respect to the 2-Wasserstein metric of a given absolutely continuous probability measure by a discrete probability measure , subject to a constraint on the particle sizes . The locations of the particles, their sizes , and the number of particles are all unknowns of the problem. We study a one-parameter family of constraints. This is an example of an optimal location problem (or an optimal sampling or quantization problem) and it has applications in economics, signal compression, and numerical integration. We establish the asymptotic minimum value of the (rescaled) approximation error as the number of particles goes to infinity. In particular, we show that for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
