On the $1$-convexity of random points in the $d$-dimensional spherical layer
Sergey Sidorov

TL;DR
This paper improves estimates for the number of randomly chosen points in a spherical layer that form a 1-convex set, where all points are vertices of their convex hull, in high-dimensional spaces.
Contribution
The paper provides an improved estimate for the size of point sets that are 1-convex with high probability in a d-dimensional spherical layer.
Findings
Enhanced bounds for 1-convex point set cardinality
Probabilistic estimates for convex hull vertices in high dimensions
Refinement over previous estimates in spherical layers
Abstract
We consider the set of points chosen randomly, independently and uniformly in the -dimensional spherical layer. A set of points is called -convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate for the cardinality of the set of points for which this set is -convex with probability close to was obtained. In this paper we obtain an improved estimate.
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
