Structure of average distance minimizers in general dimensions
Optimization and Control
2025-08-12 v3 Probability
Abstract
For a fixed, compactly supported probability measure on the -dimensional space , we consider the problem of minimizing the -power average distance functional over all compact, connected with Hausdorff 1-measure . 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 and , the first such result that includes the case when .
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}
}