返回
Gravitational allocation on the sphere
DOI:10.1073/pnas.1720804115.png)
摘要
En 中文
Given a collection L of n points on a sphere S-n(2) of surface area n, a fair allocation is a partition of the sphere into n parts each of area 1, and each is associated with a distinct point of L. We show that, if the n points are chosen uniformly at random and if the partition is defined by a certain gravitational potential, then the expected distance between a point on the sphere and the associated point of L is O(root 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(root log n), which is optimal by a result of Ajtai, Komlos, and Tusnady.
Keyword:
bipartite matching
allocation
transportation
gravity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
9.1
论文数:
10.8W
被引数:
73.5W
机构
引用论文
Isomeric Kielcorins and Dihydroxyxanthones: Synthesis, Structure Elucidation, and Inhibitory Activities of Growth of Human Cancer Cell Lines and on the Proliferation of Human Lymphocytes in vitro.
ChemInform
IF0
Wirkung der Turgorreduktion auf den Golgi-Apparat und die Bildung der Zellwand bei Wurzelhaaren
Protoplasma
IF0
Metabolism of 14C‐buthidazole in corn (Zea mays L.) and redroot pigweed (Amaranthus retroflexus L.)*
COMPETITIVE UPTAKE BY PLANTS OF POTASSIUM, RUBIDIUM, CESIUM, AND CALCIUM, STRONTIUM, BARIUM FROM SOILS
Soil Science
IF0

