English

Structure of average distance minimizers in general dimensions

Optimization and Control 2025-08-12 v3 Probability

Abstract

For a fixed, compactly supported probability measure μ\mu on the dd-dimensional space Rd\mathbb{R}^d, we consider the problem of minimizing the pthp^{\mathrm{th}}-power average distance functional over all compact, connected ΣRd\Sigma \subseteq \mathbb{R}^d with Hausdorff 1-measure H1(Σ)l\mathcal{H}^1(\Sigma) \leq l. This problem, known as the average distance problem, was first studied by Buttazzo, Oudet, and Stepanov in 2002, and has undergone a considerable amount of research since. We will provide a novel approach to studying this problem by analyzing it using the so-called \textit{barycentre field} considered previously by Hayase and two of the authors. This allows us to provide a complete topological description of minimizers in arbitrary dimensions when p=2p = 2 and p>12(3+5)2.618p > \frac{1}{2}(3 + \sqrt{5}) \approx 2.618, the first such result that includes the case when d>2d > 2.

Keywords

Cite

@article{arxiv.2503.23256,
  title  = {Structure of average distance minimizers in general dimensions},
  author = {Lucas O'Brien and Forest Kobayashi and Young-Heon Kim},
  journal= {arXiv preprint arXiv:2503.23256},
  year   = {2025}
}
R2 v1 2026-06-28T22:39:16.159Z