Structure of average distance minimizers in general dimensions

Abstract

For a fixed, compactly supported probability measure μ on the d-dimensional space Rd, we consider the problem of minimizing the pth-power average distance functional over all compact, connected ⊂eq Rd with Hausdorff 1-measure H1() ≤ 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 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 = 2 and p > 12(3 + 5) ≈ 2.618, the first such result that includes the case when d > 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…