

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Probability with Engrg Applic; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Fall 2003;
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Department of Electrical and Computer Engineering
ECE 313: Probability with Engineering Applications-Fall 2003
Problem Set 4: Mean, Variance, and Estimation
Issued: September 19, 2003 Due: September 26, 2003
Reading Assignments: Ross, Chapter 3.1-3.4, Chapter 4.1-4.
Problems NOT to be turned in:
Problems Theoretical Exercises Chapter 4 34, 35-38, 43, 48 9, 13, 15
Problems to be turned in:
(a) The expected value of the amount you win. (b) The variance of the amount you win. (c) The probability of winning at least $3.00 after ten independent tries. Please include a compu- tation, and also an application of your favorite bound. Hint: To simplify calculations, try expressing the winnings as X = aY + b, where Y is a binomial (10, p) r.v., and a, b, and p are some constants.
(a) Explain why the number of wrong answers can be modeled as a binomial random variable W. What are its parameters? (b) Obtain the ML estimate of K based on the observed value of W. (c) Do you feel that Ŵ = N − K̂ (rather than W ) should be used to determine the examination grade?
(a) Prove the following bound for a given positive constant α:
P (X > c) ≤ eΛ(α)−αc, c ∈ R,
where Λ(α) = ln E[eαX^ ]. (b) Compute Λ(α) when X is binomial (10, 12 ). (Hint: see Problem # 3.) (c) What is the best bound in (a) for the random variable in (b)? That is, the minimum of the right hand side over α ∈ R, for a given c ∈ R.. (d) What is the bound obtained using Chebyshev’s bound? (e) Compute P (X > c) in this case with c = 7, and compare to the bounds obtained in (c) and (d). NB: The inequality obtained in (c) is a version of Chernoff’s bound. This is also known as a Large Deviations estimate.