# The monotonicity of $f$-vectors of random polytopes

1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
3 Institut für Mathematik
FB6/Institut für Mathematik - Institut für Mathematik [Osnabrück]
Abstract : Let K be a compact convex body in $Rd$, let $Kn$ be the convex hull of n points chosen uniformly and independently in K, and let $fi(Kn)$ denote the number of i-dimensional faces of $Kn$. We show that for planar convex sets, $E[f0(Kn)]$ is increasing in $n$. In dimension $d≥3 we prove that if limn→∞ E[fd−1(Kn)]Anc=1$ for some constants A and c>0 then the function $n↦E[fd−1(Kn)]$ is increasing for n large enough. In particular, the number of facets of the convex hull of n random points distributed uniformly and independently in a smooth compact convex body is asymptotically increasing. Our proof relies on a random sampling argument.
Type de document :
Article dans une revue
Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2013, 18 (23), pp.1-8. 〈10.1214/ECP.v18-2469〉

Littérature citée [16 références]

https://hal.inria.fr/hal-00805690
Contributeur : Olivier Devillers <>
Soumis le : jeudi 24 novembre 2016 - 15:40:44
Dernière modification le : samedi 27 janvier 2018 - 01:32:10
Document(s) archivé(s) le : lundi 20 mars 2017 - 21:01:47

### Fichier

ecp.pdf
Fichiers éditeurs autorisés sur une archive ouverte

### Citation

Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, Matthias Reitzner. The monotonicity of $f$-vectors of random polytopes. Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2013, 18 (23), pp.1-8. 〈10.1214/ECP.v18-2469〉. 〈hal-00805690〉

### Métriques

Consultations de la notice

## 441

Téléchargements de fichiers