2000 character limit reached
On the geometry of random polytopes
Published 5 Feb 2019 in math.FA | (1902.01664v1)
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_\inftyn \cap \sqrt{\log(eN/n)} B_2n \bigr) \subset {\rm absconv}(X_1,...,X_N) $$ with high probability.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.