Central limit theorems for Gaussian polytopes

@article{Brny2006CentralLT,
  title={Central limit theorems for Gaussian polytopes},
  author={Imre B{\'a}r{\'a}ny and Van H. Vu},
  journal={Annals of Probability},
  year={2006},
  volume={35},
  pages={1593-1621}
}
Choose n random, independent points in R d according to the standard normal distribution. Their convex hull K n is the Gaussian random polytope. We prove that the volume and the number of faces of K n satisfy the central limit theorem, settling a well-known conjecture in the field. 
Comparison of f-vectors of Random Polytopes to the Gaussian Distribution
Choose n random, independent points in R^d according to a fixed distribution. The convex hull of these points is a random polytope. In some cases, central limit theorems have been proven for the
On the Mean Number of Facets of a Gaussian Polytope
A Gaussian polytope is the convex hull of normally distributed random points in a Euclidean space. We give an improved error bound for the expected number of facets of a Gaussian polytope when the
Recent Results on Random Polytopes
This is a survey over recent asymptotic results on random polytopes in d-dimensional Euclidean space. Three ways of generating a random polytope are considered: convex hulls of finitely many random
Facets of high-dimensional Gaussian polytopes
We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the
Small-Ball Probabilities for the Volume of Random Convex Sets
TLDR
This work proves small-deviation estimates for the volume of random convex sets generated by independent random points using (Lebesgue) absolutely continuous probability measures with bounded densities and the class of log-concave measures.
Random polytopes
We prove the central limit theorem for the volume and the f -vector of the random polytope Pn and the Poisson random polytope Πn in a fixed convex polytope P ⊂ IR. Here Pn is the convex hull of n
Facets of spherical random polytopes
Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as
Smoothed complexity of convex hulls by witnesses and collectors
TLDR
Upper and lower bounds on the smoothed number of faces of the convex hull under Euclidean and Gaussian noise are obtained.
The mean width of random polytopes circumscribed around a convex body
Let K be a d-dimensional convex body and let K(n) be the intersection of n halfspaces containing K whose bounding hyperplanes are independent and identically distributed. Under suitable
Limit theorems for random points in a simplex
In this work the $\ell_q$-norms of points chosen uniformly at random in a centered regular simplex in high dimensions are studied. Berry-Esseen bounds in the regime $1\leq q < \infty$ are derived and
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Central limit theorems for random polytopes
Let K be a smooth convex set. The convex hull of independent random points in K is a random polytope. Central limit theorems for the volume and the number of i dimensional faces of random polytopes
Central Limit Theorems for Random Polytopes in a Smooth Convex Set
Let K be a smooth convex set with volume one in R d. Choose n random points in K independently according to the uniform distribution. The convex hull of these points, denoted by Kn, is called a
Gaussian polytopes: variances and limit theorems
The convex hull of n independent random points in ℝ d , chosen according to the normal distribution, is called a Gaussian polytope. Estimates for the variance of the number of i-faces and for the
Asymptotic mean values of Gaussian polytopes
We consider geometric functionals of the convex hull of normally distributed random points in Euclidean space R. In particular, we determine the asymptotic behaviour of the expected value of such
Limit theorems for the convex hull of random points in higher dimensions
We give a central limit theorem for the number Nn of vertices of the convex hull of n independent and identically distributed random vectors, being sampled from a certain class of spherically
FEW POINTS TO GENERATE A RANDOM POLYTOPE
A random polytope, Kn, is the convex hull of n points chosen randomly, independently, and uniformly from a convex body K^Rd. It is shown here that, with high probability, Kn can be obtained by taking
Random projections of regular simplices
Precise asymptotic formulae are obtained for the expected number ofk-faces of the orthogonal projection of a regularn-simplex inn-space onto a randomly chosen isotropic subspace of fixed dimension or
SHARP CONCENTRATION OF RANDOM POLYTOPES
We prove that key functionals (such as the volume and the number of vertices) of a random polytope is strongly concentrated, using a martingale method. As applications, we derive new estimates for
THE CONVEX HULL OF A NORMAL SAMPLE
Consider the convex hull of n independent, identically distributed points in the plane. Functionals of interest are the number of vertices Nns the perimeter Ln and the area An of the convex hull. We
Limit theorems for convex hulls
It is shown that the process of vertices of the convex hull of a uniform sample from the interior of a convex polygon converges locally, after rescaling, to a strongly mixing Markov process, as the
...
1
2
3
4
5
...