

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: Exam; Class: Random Processes; Subject: Electrical and Computer Engr; University: University of Illinois - Urbana-Champaign; Term: Unknown 1989;
Typology: Exams
1 / 2
This page cannot be seen from the preview
Don't miss anything!


35
(a) E[(Bk − 0)^2 ] = E[A^21 ]k^ = ( 58 )k^ → 0 as k → ∞. Thus, limk→∞ m.s. Bk = 0. (b) Each sample path of the sequence Bk is monotone nonincreasing and bounded below by zero, and is hence conver- gent. Thus, limk→∞ a.s. Bk exists. (The limit has to be the same as the m.s. limit, so Bk converges to zero almost surely.) (c) Mean square convergence implies convergence of the mean. Thus, the mean of the limit is limn→∞ E[Sn] = limn→∞
Pn P∞ k=1^ E[Bk^ ] = k=1(^
3 4 )
k (^) = 3. By the property given in the problem statement, the second moment of the limit is 35 3 , so the variance of the limit is 353 − 32 = 83. (d) Each sample path of the sequence Sn is monotone nondecreasing and is hence convergent. Thus, limk→∞ a.s. Bk exists. (The limit has to be the same as the m.s. limit.)
Here is a proof of the claim given in part (c) of the problem statement, although the proof was not asked for on the exam. If j ≤ k, then E[Bj Bk ] = E[A^21 · · · A^2 j Aj+1 · · · Ak ] = ( 58 )j^ ( 34 )k−j^ , and a similar expression holds for j ≥ k. Therefore,
E[SnSm] = E[
X^ n
j=
Bj
Xn
k=
Bk ] =
X^ n
j=
X^ n
k=
E[Bj Bk ]
j=
k=
E[Bj Bk ]
j=
k=j+
«j „ 3 4
«k−j
j=
«j
j=
l=
«j „ 3 4
«l
j=
«j
j=
«j )(
l=
«l
(a) TRUE. The estimator E[X|Y ] yields a smaller MSE than any other function of Y , including Eb[X|Y, Y 2 ].
(b) TRUE. Equality holds because the unconstrained estimator with the smallest mean squre error, E[X|Y ], is linear, and the MSE for Eb[X|Y, Y 2 ] is less than or equal to the MSE of any linear estimator.
(c) FALSE. For example if X is a nonconstant random variable, Y = X, and Z ≡ 0, then, on one hand, E[X|Z] = E[X], so E[E[X|Z]|Y ] = E[X], and thus E[|X − E[E[X|Z]|Y ]|^2 ] = Var(X). On the other hand, E[X|Y ] = X so that
E[|X − E[X|Y ]|^2 ] = 0. (d) FALSE. For example, suppose X = Y W , where W is a random variable independent of Y with mean zero and variance
one. Then given Y , the conditional distribution of X has mean zero and variance Y 2. In particular, E[X|Y ] = 0, so that E[|X − E[X|Y ]|^2 ] = Var(X), but X and Y are not independent.
θ
Sen
(a) el(a) = maxθ {θa − MX (θ)} where
MX (θ) = log E[exp(θX)] = log{f E[exp(θY )] + (1 − f )E[exp(θZ)]} = log{f exp(MY (θ)) + (1 − f ) exp(MZ (θ))}
(b) View f exp(MY (θ)) + (1 − f ) exp(MZ (θ)) as an average of exp(MY (θ)) and exp(MZ (θ)). The definition of con- cavity (or Jensen’s inequality) applied to the concave function log u implies that log(average) ≥ average(log), so that log{f exp(MY (θ))+(1−f ) exp(MZ (θ)) ≥ f MY (θ)+(1−f )MZ (θ), where we also used the fact that log exp MY (θ) = MY (θ). Therefore, el(a) ≤ l(a) for all a.
Remark: This means that Se nn is more likely to have large deviations than S nn. That is reasonable, because Se nn has
randomness due not only to FY and FZ , but also due to the random coin flips. This point is particularly clear in case the Y ’s and Z’s are constant, or nearly constant, random variables.