DeepAI AI Chat
Log In Sign Up

Estimating the probability that a given vector is in the convex hull of a random sample

by   Satoshi Hayakawa, et al.
University of Oxford

For a d-dimensional random vector X, let p_n, X be the probability that the convex hull of n i.i.d. copies of X contains a given point x. We provide several sharp inequalities regarding p_n, X and N_X, which denotes the smallest n with p_n, X≥ 1/2. As a main result, we derive a totally general inequality which states 1/2 ≤α_X N_X ≤ 16d, where α_X (a.k.a. the Tukey depth) is the infimum of the probability that X is contained in a fixed closed halfspace including the point x. We also provide some applications of our results, one of which gives a moment-based bound of N_X via the Berry-Esseen type estimate.


page 1

page 2

page 3

page 4


L^p-norm inequality using q-moment and its applications

For a measurable function on a set which has a finite measure, an inequa...

Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020

We give an overview of the 2020 Computational Geometry Challenge, which ...

Estimating a probability of failure with the convex order in computer experiments

This paper deals with the estimation of a failure probability of an indu...

A correlation inequality for random points in a hypercube with some implications

Let ≺ be the product order on ℝ^k and assume that X_1,X_2,…,X_n (n≥3) ar...

Graph Convex Hull Bounds as generalized Jensen Inequalities

Jensen's inequality is ubiquitous in measure and probability theory, sta...

Identification of Dynamic Panel Logit Models with Fixed Effects

We show that the identification problem for a class of dynamic panel log...

A phase transition for the probability of being a maximum among random vectors with general iid coordinates

Consider n iid real-valued random vectors of size k having iid coordinat...