# Need statistics help with Chernoff Bound and Markov Bound

Anonymous
account_balance_wallet \$5

### Question Description

One night, there are 4 dozen free donuts upstairs. The 25 people in 271 are working on a midnight 61C deadline, and are each 30% likely to ignore the donuts. The 40 people in the other labs aren’t as stressed, but are each 10% likely to have already filled up on pizza (per midterm 2). Assume that everyone makes their decision independently.

School: Cornell University

(a) A Chernoff bound for binomial variables that one can derive from the lecture states that for

the sum of independent indicator variables with expectation µ and α ≥ 1 that Pr[X ≥ αµ] ≤

exp(αµ−µ−αµlnα

). Use this fact to bound the probability that there’ll be enough donuts for everyone

(assuming, unrealistically, that no one takes seconds).

(b) Part a uses a form of Chernoff bound derived by applying the Markov bound to α

^X1+...+Xn

.You should use the inequality e

^x ≥ x+1

flag Report DMCA
Review

Anonymous
Thanks, good work

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors