Translator Disclaimer
January 2021 Gravitational allocation for uniform points on the sphere
Nina Holden, Yuval Peres, Alex Zhai
Ann. Probab. 49(1): 287-321 (January 2021). DOI: 10.1214/20-AOP1452

Abstract

Given a collection $\mathcal{L}$ of $n$ points on a sphere $\mathbf{S}^{2}_{n}$ of surface area $n$, a fair allocation is a partition of the sphere into $n$ cells each of area $1$, and each associated with a distinct point of $\mathcal{L}$. We show that if the $n$ points are chosen uniformly at random and the partition is defined by considering a “gravitational” potential defined by the $n$ points, then the expected distance between a point on the sphere and the associated point of $\mathcal{L}$ is $O(\sqrt{\log n})$. We use our result to define a matching between two collections of $n$ independent and uniform points on the sphere and prove that the expected distance between a pair of matched points is $O(\sqrt{\log n})$, which is optimal by a result of Ajtai, Komlós and Tusnády. Furthermore, we prove that the expected number of maxima for the gravitational potential is $\Theta (n/\log n)$. We also study gravitational allocation on the sphere to the zero set $\mathcal{L}$ of a particular Gaussian polynomial, and we quantify the repulsion between the points of $\mathcal{L}$ by proving that the expected distance between a point on the sphere and the associated point of $\mathcal{L}$ is $O(1)$.

Citation

Download Citation

Nina Holden. Yuval Peres. Alex Zhai. "Gravitational allocation for uniform points on the sphere." Ann. Probab. 49 (1) 287 - 321, January 2021. https://doi.org/10.1214/20-AOP1452

Information

Received: 1 February 2019; Revised: 1 January 2020; Published: January 2021
First available in Project Euclid: 22 January 2021

Digital Object Identifier: 10.1214/20-AOP1452

Subjects:
Primary: 60D05, 60G55

Rights: Copyright © 2021 Institute of Mathematical Statistics

JOURNAL ARTICLE
35 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.49 • No. 1 • January 2021
Back to Top