# Random vector of fixed entry-sum

Recently I come up with an embarrassingly easy question. It should be known or elementary but I am still not able to find either a correct answer or references:

"Consider a random vector $x=(x_1,...,x_n)$ in the simplex $0\le x_i, x_1+..+x_n=1$. It is easy to show that each $x_i$ has beta distribution $B(1,n-1)$. It can be also checked that the expected value of $|x|_2$ is of order $n^{-1/2}$.

I am wondering if there is any concentration result saying that there exists a sufficiently large constant $C$ such that $|x|_2 \le Cn^{-1/2}$ with high probability, say $1-n^{-3}$? "

Thanks.

-

For the expected norm see equation (19) in this paper (or equation (12) in the published version of that paper), which, after some renormalizing, states that $$\mathbb{E} x_1^{r_1} \cdots x_n^{r_n} = \frac{(n-1)! r_1! \cdots r_n!}{(r+n-1)!},$$ where $r_i \ge 0$ and $r = r_1 + \cdots r_n$. So in particular (if you can trust my arithmetic) $$\mathbb{E} ||x||^2 = \frac{2}{n+1}, \quad \mathbb{E} ||x||^4 = \frac{4(n+5)}{(n+1)(n+2)(n+3)}.$$ From these standard Hölder's inequality estimates give that $\mathbb{E} ||x||$ is of order $n^{-1/2}$.
Thanks a lot for the references. When I try to apply "Borell's lemma", where P is the given simplex and A is a sphere of radius $O(n^{1/2})$ centered at $(1/n,\dots,1/n)$, I got a bound like $P(|x|^2 \ge C/n) = O(\exp(-C))$. Although this is good, it is still not anything of order $n^{-3}$. Did I miss something? – user21174 Feb 6 '12 at 23:36
This is pretty standard. One way to do it is written out quite explicitly in the paper of mine which I linked to in the answer. In any case, by symmetry considerations, once you translate T so that its center is at the origin, what you get is isotropic up to scaling in the hyperplane $x_1 + \cdots + x_n = 0$; the right rescaling (ou need to blow up by a factor of order n I think off the top of my head) follows from the calculations in my answer above. – Mark Meckes Feb 7 '12 at 13:57