Back to 16.3 Problems on Conditional Independence, Given a Random Vector

16.3 Exercise 6

Avg difficulty 2.5

Consider the composite demand D introduced in the section on Random Sums in "Random Selecton"

D = ∑ n = 0 ∞ I { k } ( N ) X n where X n = ∑ k = 0 n Y k , Y 0 = 0 D = \sum_{n = 0}^{\infty} I_{\left\{k\right\}} \left(N\right) X_{n} \text{where} X_{n} = \sum_{k = 0}^{n} Y_{k} , Y_{0} = 0

Suppose {N,H}\left\{N , H\right\} is independent, {N,Yi} ci |H\left\{N , Y_{i}\right\} ci \left|\right. H for all i, and E[Yi|H]=e(H)E \left[\right. Y_{i} \left|\right. H \left]\right. = e \left(H\right), invariant with i. Show that E[D|H]=E[N]E[Y|H]a.s.E \left[\right. D \left|\right. H \left]\right. = E \left[N\right] E \left[\right. Y \left|\right. H \left]\right. a . s ..

Pfeiffer, Applied Probability, 16.3 Problems on Conditional Independence, Given a Random Vector, exercise 6

AI Tutor

Adapted from Applied Probability © 2009 Paul E. Pfeiffer. Licensed under CC BY 3.0. Source: Applied Probability. Imported at revision d7a0420.