Estimating the probability that a given vector is in the convex hull of a random sample
From MaRDI portal
Publication:2689428
DOI10.1007/s00440-022-01186-1OpenAlexW3120055470MaRDI QIDQ2689428
Publication date: 10 March 2023
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04250
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High order recombination and an application to cubature on Wiener space
- Asymptotic shape of a random polytope in a convex body
- On a notion of data depth based on random simplices
- Random convex hulls and extreme value statistics
- The random Tukey depth
- On the complexity of a pivot step of the revised simplex algorithm
- Breakdown properties of location estimates based on halfspace depth and projected outlyingness
- The reverse isoperimetric problem for Gaussian measure
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Random spaces generated by vertices of the cube
- Halfspace depth and floating body
- Monte Carlo cubature construction
- Monte Carlo construction of cubature on Wiener space
- A multivariate Berry-Esseen theorem with explicit constants
- A high-dimensional CLT in \(\mathcal {W}_2\) distance with near optimal convergence rate
- Smallest singular value of random matrices and geometry of random polytopes
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums
- Cubature on Wiener space
- Thrifty Approximations of Convex Bodies by Polytopes
- The Efficiency of the Simplex Method: A Survey
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- A Problem in Geometric Probability.
- The convex floating body.
- High-Dimensional Probability
- Absorption probabilities for Gaussian polytopes and regular spherical simplices
- On the geometry of polytopes generated by heavy-tailed random vectors
- A new approach for the computation of halfspace depth in high dimensions
- Random polytopes obtained by matrices with heavy-tailed entries
- Random Polytopes
- Robustness and Complex Data Structures
- The proof of Tchakaloff’s Theorem
- Functional analysis
- A continuous analogue of the upper bound theorem
- The depth function of a population distribution.
This page was built for publication: Estimating the probability that a given vector is in the convex hull of a random sample