Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Azuma:
TR10-072 | 19th April 2010
Russell Impagliazzo, Valentine Kabanets

Constructive Proofs of Concentration Bounds

We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound~\cite{Chernoff, Hof63}, which says that the sum of independent $\{0,1\}$-valued random variables is highly concentrated around the expected value. Unlike the standard proofs,
our proof does not use the method of higher moments, but rather uses a simple ... more >>>

ISSN 1433-8092 | Imprint