# average of i.i.d. exponential random variables

I have a question about the following probability:

$Pr\{\frac{\sum^N_{k=1}u_k}{N}<1\}$

where $u_k\sim \exp(1)$ are i.i.d. exponential random variables with mean one (also, $\frac{\sum^N_{k=1}u_k}{N}$ is gamma distributed).

I have plotted this probability for different $N$. The plot shows that as $N$ increases, this probability approaches $0.5$. Is this a well-known result? Has someone proved it already? If not, how to prove it rigorously?

-

## 1 Answer

You are right. This type of result is, however, not new, and applies to a very large class of random variables of a shape similar to yours. In particular, the fact that the random variables being averaged have exponential distribution has almost nothing to do with the result.

For a proof, it is probably best to use the Central Limit Theorem. Call your random variable (the average of the $N$ exponentials) by the name $Y_N$.

Since you are taking an average of $N$ random variables with mean $1$, the random variable $Y_N$ has mean $1$. Since each of the exponentials has variance $1$, and they are independent, their sum has variance $N$, and therefore $Y_N$, which is $1/N$ times the sum, has variance $\frac{N}{N^2}$, which is $\frac{1}{N}$.

The Central Limit Theorem says that if $Y_N$ is the average of $N$ independent random variables with mean $\mu$ and variance $\sigma^2$, then $$\lim_{N\to\infty}P\left(\sqrt{N}(Y_N-\mu)\le z\right)=\Phi(z/\sigma),$$ where $\Phi$ is the cumulative distribution function of the standard normal. In our case, we have $\mu=1$ and $\sigma=1$. So we can rewrite the above result as $$\lim_{N\to\infty}P\left(Y_N\le 1+\frac{z}{\sqrt{N}}\right)=\Phi(z). \qquad(\ast)$$ Now just put $z=0$. Since $F(0)=1/2$, we get the fact that you observed.

With relatively well-behaved random variables like your mean $1$ exponentials, the approach to normality is very rapid. Thus we can, for largish $N$, remove the limit part, and use $(\ast)$ as an estimate of $P(Y_N-1\le \frac{z}{\sqrt{N}})$.

-

thank you very much for such a detailed proof. It's a rigorous proof, and very clear. Thanks for these inputs. – Scholli Feb 23 '12 at 9:24
By the way, I assume that the last probability is $P(Y_N<1)<\frac{z}{\sqrt{N}}$. – Scholli Feb 23 '12 at 9:25
@Scholli: Thanks for pointing out the typo. Fixed. But it may not be the only one. – André Nicolas Feb 23 '12 at 9:44
I think the other calculations are correct ;) – Scholli Feb 23 '12 at 14:10
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 32, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9378731846809387, "perplexity_flag": "head"}