scientific article; zbMATH DE number 16685
From MaRDI portal
Publication:3973370
[For the entire collection see Zbl 0722.00003.] Let \(V_ n\) be the expected volume of the convex hull of \(N(n)\) points chosen at random from the set of the vertices of the \(n\)-cube \([0,1]^ n\) in \(\mathbb{R} ^ n\). How large should \(N(n)\) be to get \(V_ n\rightarrow 1\) as \(n\rightarrow\infty\)? The authors also investigate the corresponding questions for random points in the interior of the \(n\)-cube and in the \(n\)-ball.
Recommendations
Cited in
(17)- A note on the volume of a random polytope in a tetrahedron
- Random polytopes in the d-dimensional cube
- Random spaces generated by vertices of the cube
- On random sections of the cube
- Union of hypercubes and 3D Minkowski sums with random sizes
- The curse of dimensionality for the class of monotone functions and for the class of convex functions
- The curse of dimensionality for numerical integration of smooth functions. II
- Approximation of convex sets by polytopes
- Some results on the complexity of numerical integration
- Comment on ``volumes spanned by random points in the hypercube
- Random distributions of points inn‐dimensional cubes
- Volumes Spanned by Random Points in the Hypercube
- The Volume of a Tetrahedron whose Vertices are Chosen at Random in the Interior of a Parent Tetrahedron
- Asymptotic moments of near–neighbour distance distributions
- What is the expected volume of a tetrahedron whose vertices are chosen at random from a given tetrahedron?
- Random cones in high dimensions. I: Donoho-Tanner and Cover-Efron cones.
- Half-space depth of log-concave probability measures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973370)
