2000 character limit reached
Random version of Dvoretzky's theorem in $\ell_p^n$
Published 25 Oct 2015 in math.FA | (1510.07284v2)
Abstract: We study the dependence on $\varepsilon$ in the critical dimension $k(n,p,\varepsilon)$ for which one can find random sections of the $\ell_pn$-ball which are $(1+\varepsilon)$-spherical. We give lower (and upper) estimates for $k(n,p,\varepsilon)$ for all eligible values $p$ and $\varepsilon$ as $n\to \infty$, which agree with the sharp estimates for the extreme values $p=1$ and $p=\infty$. Toward this end, we provide tight bounds for the Gaussian concentration of the $\ell_p$-norm.
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.