An improvement on the Rado bound for the centerline depth
Alexander Magazinov, Attila P\'or

TL;DR
This paper improves the lower bounds on the half-space depth for certain flats in high-dimensional spaces, surpassing the classical Rado bound for most cases.
Contribution
The authors provide new lower bounds for the half-space depth of k-flats in ^d, improving upon the Rado bound for all pairs (d,k) except the known optimal cases.
Findings
For k=1 and d, a line with depth at least 1/d + 1/(3d^3) exists.
For all 0<k<d-1, there exists a k-flat with depth at least 1/(d+1-k) + 1/(3(d+1-k)^3).
The bounds are strictly better than the classical Rado bound in these cases.
Abstract
Let be a Borel probability measure in . For a -flat consider the value , where runs through all half-spaces containing . This infimum is called the half-space depth of . Bukh, Matou\v{s}ek and Nivasch conjectured that for every and every there exists a -flat with the depth at least . The Rado Centerpoint Theorem implies a lower bound of (the Rado bound), which is, in general, much weaker. Whenever the Rado bound coincides with the bound conjectured by Bukh, Matou\v{s}ek and Nivasch, i.e., for and , it is known to be optimal. In this paper we show that for all other pairs one can improve on the Rado bound. If and we show that there is a 1-dimensional line with the depth at least $\tfrac{1}{d} +…
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
TopicsPoint processes and geometric inequalities · Advanced Numerical Analysis Techniques · Computational Geometry and Mesh Generation
