Random polytopes in the d-dimensional cube

DOI10.1007/BF02187704zbMath0607.52004OpenAlexW2055758906MaRDI QIDQ1085440

Zoltan Fueredi

Publication date: 1986

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130999

zbMATH Keywords

random polytopes in d-dimensional cubes

Mathematics Subject Classification ID

Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (8)

On the perceptron learning algorithm on data with high precision ⋮ On the shape of the convex hull of random points ⋮ On subspaces spanned by random selections of \(\pm 1\) vectors ⋮ Doubly random polytopes ⋮ Programmed interactions in higher-order neural networks: Maximal capacity ⋮ Convex bodies, economic cap coverings, random polytopes ⋮ Monte Carlo cubature construction ⋮ Covering cubes by random half cubes, with applications to binary neural networks

Cites Work

• Unnamed Item
• On random convex hulls
• Random polytopes in a ball
• A Problem in Geometric Probability.
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• The number of partitions of a set of N points in k dimensions induced by hyperplanes
• Partitions ofN-Space by Hyperplanes

This page was built for publication: Random polytopes in the d-dimensional cube