Estimating the probability that a given vector is in the convex hull of a random sample
From MaRDI portal
Publication:2689428
Recommendations
- Inequalities for convex hulls of random points
- Random convex hulls: Floating bodies and expectations
- Deviation inequalities for random polytopes in arbitrary convex bodies
- On the shape of the convex hull of random points
- Principes d'invariance pour la probabilité d'un dilaté de l'enveloppe convexe d'un échantillon. (Invariance principles for the probability of a dilation of the convex hull of a sample)
Cites work
- scientific article; zbMATH DE number 3129782 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 3591295 (Why is no real title available?)
- scientific article; zbMATH DE number 1313392 (Why is no real title available?)
- scientific article; zbMATH DE number 3043546 (Why is no real title available?)
- A Problem in Geometric Probability.
- A continuous analogue of the upper bound theorem
- A high-dimensional CLT in \(\mathcal {W}_2\) distance with near optimal convergence rate
- A multivariate Berry-Esseen theorem with explicit constants
- A new approach for the computation of halfspace depth in high dimensions
- Absorption probabilities for Gaussian polytopes and regular spherical simplices
- An improvement of the Berry-Esseen inequality with applications to Poisson and mixed Poisson random sums
- Asymptotic shape of a random polytope in a convex body
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- Cubature on Wiener space
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- Functional analysis
- Halfspace depth and floating body
- High order recombination and an application to cubature on Wiener space
- High-dimensional probability. An introduction with applications in data science
- Monte Carlo construction of cubature on Wiener space
- Monte Carlo cubature construction
- On a notion of data depth based on random simplices
- On the complexity of a pivot step of the revised simplex algorithm
- On the geometry of polytopes generated by heavy-tailed random vectors
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Random convex hulls and extreme value statistics
- Random polytopes
- Random polytopes obtained by matrices with heavy-tailed entries
- Random spaces generated by vertices of the cube
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- Robustness and Complex Data Structures
- Smallest singular value of random matrices and geometry of random polytopes
- The Efficiency of the Simplex Method: A Survey
- The convex floating body.
- The depth function of a population distribution.
- The proof of Tchakaloff’s Theorem
- The random Tukey depth
- The reverse isoperimetric problem for Gaussian measure
- Thrifty approximations of convex bodies by polytopes
Cited in
(9)- Calculation of the probability that a normal random vector lies in a circular cone
- Evaluating inclusion functionals for random convex hulls
- Probabilities of hitting a convex hull
- Mahalanobis balancing: a multivariate perspective on approximate covariate balancing
- Estimating the probability that a given vector is in the convex hull of a random sample
- A probabilistic formula for the concave hull of a function
- Explicit bivariate simplicial depth
- Approximation of the average of some random matrices
- Principes d'invariance pour la probabilité d'un dilaté de l'enveloppe convexe d'un échantillon. (Invariance principles for the probability of a dilation of the convex hull of a sample)
This page was built for publication: Estimating the probability that a given vector is in the convex hull of a random sample
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689428)
