vix.ing · top · new · best · stats · spec

On the geometry of random polytopes

2019/02/05 by Shahar Mendelson, Mendelson, Shahar · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #FOS: Mathematics #Functional Analysis (math.FA) #Point processes and geometric inequalities #Random Matrices and Applications

paper · doi:10.48550/arxiv.1902.01664

openalex publication_date 2019/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a simple proof to a fact recently established in [5]: let ξ be a symmetric random variable that has variance 1, let Γ=(ξij) be an N × n random matrix whose entries are independent copies of ξ, and set X1,...,XN to be the rows of Γ. Then under minimal assumptions on ξ and as long as N ≥ c1n, c2 (B_∞n ∩ √(log(eN/n)) B2n ) ⊂ \rm absconv(X1,...,XN) with high probability.

Cited by

Related