Depth with respect to a family of convex sets
Leonardo Mart\'inez-Sandoval, Roee Tamam

TL;DR
This paper introduces a new depth measure relative to a family of convex sets, explores its properties, and connects it to combinatorial hitting set problems, extending classical theorems like Helly's and Rado's.
Contribution
It defines a novel depth measure for convex set families, analyzes its properties, and links it to combinatorial problems, providing bounds and applications in geometric transversal theory.
Findings
The depth measure satisfies key properties similar to Tukey depth.
Bounds for the best guaranteed depth depend on the intersection parameter k.
Applications include a Helly-type theorem for fractional hyperplane transversals.
Abstract
We propose a notion of depth with respect to a finite family of convex sets in which we call . We begin showing that satisfies some expected properties for a measure of depth and that this definition is closely related to the notion of depth proposed by J. Tukey. We show that some properties of Tukey depth extend to and we point out some key differences. We then focus on the following centerpoint-type question: what is the best depth that we can guarantee under the hypothesis that the family is -intersecting? We show a key connection between this problem and a purely combinatorial problem on hitting sets. The relationship is useful in both directions. On the one hand, for values of close to the combinatorial interpretation gives a good bound…
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.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Computational Geometry and Mesh Generation
