E2 202 (Aug-Dec 2015) : Homework Assignment 3
E2 202 (Aug-Dec 2015) : Homework Assignment 3
Homework Assignment 3
Discussion: Friday, Sept. 4
1
, for k = 1, 2, 3, . . . ,
k2
1
n
Pn
i=1 Xi .
(b) Use Chebyshevs inequality to bound the probability P (|X| > ) for > 0.
(c) Use the Chernoff bounding technique to show that for 0 < < 1,
P (X > ) 2n[1h(
1+
)]
2
where h() is the binary entropy function defined by h(x) = x log2 (x) (1 x) log2 (1 x) for
x [0, 1]. Hence, by symmetry,
P (|X| > ) = 2 P (X > ) 2 2n[1h(
1+
)]
2
The point of this exercise is that the Chernoff bound yields an exponential decay in n for the tail probability
of X, while Chebyshevs inequality only yields a 1/n decay.