Universal Ahlfors--David regularity of Steiner trees
Danila Cherkashin, Pavel Prozorov, Yana Teplitskaya

TL;DR
This paper establishes that Steiner trees, after removing neighborhoods of the given set, are uniformly regular in a quantitative way, with bounds depending only on the dimension, leading to structural insights especially in two dimensions.
Contribution
The authors prove a dimension-independent Ahlfors--David regularity result for Steiner trees, providing explicit bounds and structural properties in higher dimensions.
Findings
St_5varepsilon is Ahlfors--David regular with constants depending only on dimension.
The set St_5varepsilon contains at most a certain number of line segments within specified neighborhoods.
In two dimensions, the paper achieves tight structural characterizations of Steiner trees.
Abstract
The celebrated Steiner tree problem is the problem of finding a set of minimum one-dimensional Hausdorff measure (length) such that is connected, where is a given compact set. Paolini and Stepanov provided very general existence and regularity results for the Steiner problem. Their main regularity result is that under a natural assumption, , for almost every the set is an embedded finite forest (acyclic graph). We give a quantitative regularity result by proving that the set is Ahlfors--David regular with constants that depend only on (and not on ). Namely, for , every , every , and every choice of , we have \[ \frac{H \left…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
