pith. sign in

arxiv: 1902.01664 · v1 · pith:HNEVJK3Unew · submitted 2019-02-05 · 🧮 math.FA

On the geometry of random polytopes

classification 🧮 math.FA
keywords randomgammaabsconvassumptionsbiglbigrcopiesentries
0
0 comments X
read the original abstract

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set $X_1,...,X_N$ to be the rows of $\Gamma$. Then under minimal assumptions on $\xi$ and as long as $N \geq c_1n$, $$ c_2 \bigl(B_\infty^n \cap \sqrt{\log(eN/n)} B_2^n \bigr) \subset {\rm absconv}(X_1,...,X_N) $$ with high probability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the geometry of polytopes generated by heavy-tailed random vectors

    math.PR 2019-07 unverdicted novelty 8.0

    Under minimal assumptions on X, centrally symmetric random polytopes generated by N ≳ n copies of X contain the polar of its floating body with high probability.