Chernoff Bound

In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is a sharper bound than the known first or second moment based tail bounds such as Markov's inequality or Chebyshev inequality, which only yield power-law bounds on tail decay. However, the Chernoff bound requires that the variates be independent - a condition that neither the Markov nor the Chebyshev inequalities require.

It is related to the (historically earliest) Bernstein inequalities, and to Hoeffding's inequality.

Read more about Chernoff Bound:  Definition, A Motivating Example, The First Step in The Proof of Chernoff Bounds, Applications of Chernoff Bound, Matrix Chernoff Bound

Famous quotes containing the word bound:

    “I’the commonwealth I would by contraries
    Execute all things; for no kind of traffic
    Would I admit; no name of magistrate;
    Letters should not be known; riches, poverty,
    And use of service, none; contract, succession,
    Bourn, bound of land, tilth, vineyard, none;
    No use of metal, corn, or wine, or oil;
    No occupation; all men idle, all,
    And women too, but innocent and pure.”
    —William Shakespeare (1564–1616)