Recently I came across the following question when I read a paper about Gaussian processes:
Let $g_1,g_2,\ldots,g_N$ be i.i.d. standard Gaussian random variables in $\mathbb{R}$. Then, for any $1\le m\le N$,
$$ \mathbb{E} \max_{|I|=m} \bigg(\sum_{i\in I} g_i^2\bigg)^{1/2} \asymp \sqrt{m\log (eN/m)}, $$ where the maximum is taken over all subsets of $\{1,2,\ldots,N\}$ whose cardinality is $m$. The notation $a \asymp b$ means that $cb\le a\le Cb$ for two absolute constants $c$ and $C$.
My question is: how to prove the bounds stated above? Thanks for any possible ideas or comments!