Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For the sum $X$ of independent 0-1 random variables $X_i$ ($0 \le i \le n-1$) with $Pr(X_i)=p_i$, namely $X=\sum_{i=0}^{n-1}{X_i}$ the following Chernoff bound holds, $$ Pr(X \ge (1+\delta)\mu) \le \left(\frac{e^\delta}{(1+\delta)^{1+\delta}}\right)^\mu $$ where $\mu=E[X]$ is the expected value of $X$. But how tight is this bound? Is there any lower bound for $Pr(X \ge (1+\delta)\mu)$. If exist, is it also exponential to $\mu$?

share|cite|improve this question
up vote 1 down vote accepted

Any lower bound would have to be zero for $\delta$ large enough, namely $\delta > (n/\mu)−1$. And one can manage for $(n/\mu)−1$ to be as small as one wants. This suggests that universal lower bounds are unlikely.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.