Math 2.0

Probability theory and stochastic processes Inequalities Theorem

Chernoff bound

Builds on Markov's inequalityMoment-generating function

Statement

Let XX be a real random variable with moment-generating function MX(t)=E[etX]M_X(t) = E[e^{tX}], and let a∈ℝa \in \mathbb{R}. Then P(X≥a)≤inf⁡t>0e−taMX(t).P(X \ge a) \le \inf_{t > 0} e^{-ta} M_X(t).

Remarks

Proof: for each t>0t > 0, {X≥a}={etX≥eta}\{X \ge a\} = \{e^{tX} \ge e^{ta}\}. Markov's inequality gives P(X≥a)≤e−taE[etX]P(X \ge a) \le e^{-ta} E[e^{tX}]. Then take the infimum over tt. For a sum SS of independent XiX_i, MS=∏iMXiM_S = \prod_i M_{X_i}. So the bound becomes inf⁡t>0e−ta∏iMXi(t)\inf_{t > 0} e^{-ta} \prod_i M_{X_i}(t), which decreases exponentially in many cases. For S∼Bin⁡(n,p)S \sim \operatorname{Bin}(n, p) with mean μ=np\mu = np and 0<δ0 < \delta, a standard consequence is P(S≥(1+δ)μ)≤(eδ/(1+δ)1+δ)μP(S \ge (1 + \delta)\mu) \le \left(e^{\delta} / (1 + \delta)^{1 + \delta}\right)^{\mu}.

History

The bound is named after Herman Chernoff.

Reading path

To understand this page from the ground up, read these 54 pages in order. The foundations come first.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Ordered field definition
  5. Proposition concept
  6. Random experiment concept
  7. Rational numbers object
  8. Real numbers object
  9. Set definition
  10. Ring of integers statement
  11. Disjunction definition
  12. Implication definition
  13. Predicate definition
  14. Ordered pair definition
  15. Union definition
  16. Sample space definition
  17. The rationals form a field statement
  18. Existential quantifier definition
  19. Universal quantifier definition
  20. Cartesian product definition
  21. Subset definition
  22. The rationals form an ordered field statement
  23. Uniqueness quantifier definition
  24. Binary relation definition
  25. Universal set definition
  26. Order on the reals definition
  27. Power set definition
  28. Complement definition
  29. Function definition
  30. Interval definition
  31. Injective function definition
  32. Preimage of a set definition
  33. Sigma-algebra definition
  34. Countable set definition
  35. Event definition
  36. Borel sigma-algebra definition
  37. Probability axioms concept
  38. Probability measure definition
  39. Probability distribution definition
  40. Probability space definition
  41. Monotonicity of probability statement
  42. Random variable definition
  43. Cumulative distribution function definition
  44. Discrete random variable definition
  45. Law of a random variable definition
  46. Random variable with a density definition
  47. Probability mass function definition
  48. Expected value definition
  49. Probability density function definition
  50. Markov's inequality statement
  51. Law of the unconscious statistician statement
  52. Moment definition
  53. Moment-generating function definition
  54. Chernoff bound statement

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Chernoff_bound, Generic Chernoff bounds
About this page
Tag014PEBGDYF
URIm2://014PEBGDYF
Kindstatement, theorem
WritingW0 stub
MSC60E15
StatusThis copy of the site has no build data. Run m2 status 014PEBGDYF.
UsesMarkov's inequality, Moment-generating function
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by