Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

The joint probability mass function of \(X\) and \(Y, p(x, y)\), is given by $$ \begin{array}{ll} p(1,1)=\frac{1}{9}, & p(2,1)=\frac{1}{3}, & p(3,1)=\frac{1}{9} \\ p(1,2)=\frac{1}{9}, & p(2,2)=0, & p(3,2)=\frac{1}{18} \\ p(1,3)=0, & p(2,3)=\frac{1}{6}, & p(3,3)=\frac{1}{9} \end{array} $$ Compute \(E[X \mid Y=i]\) for \(i=1,2,3\).

Short Answer

Expert verified
The conditional expectations \(E[X \mid Y=i]\) for \(i=1,2,3\) are as follows: For \(Y=1\): \(E[X \mid Y=1] =\frac{13}{6}\) For \(Y=2\): \(E[X \mid Y=2] =\frac{7}{4}\) For \(Y=3\): \(E[X \mid Y=3] =\frac{20}{9}\)

Step by step solution

01

Calculate the marginal probability of Y for each value i

Since we need to compute the conditional probabilities for each value of i, we first need to calculate the marginal probability of Y=i. Then marginal probability of Y is given by summing the joint probabilities of each combination that has Y=i. For Y=1, the marginal probability is calculated by summing the probabilities for (1, 1), (2, 1), and (3, 1) as follows: \(P(Y=1) = p(1,1) + p(2,1) + p(3,1) = \frac{1}{9} + \frac{1}{3} + \frac{1}{9}\) For Y=2, the marginal probability is calculated by summing the probabilities for (1, 2), (2, 2), and (3, 2) as follows: \(P(Y=2) = p(1,2) + p(2,2) + p(3,2) = \frac{1}{9} + 0 + \frac{1}{18}\) For Y=3, the marginal probability is calculated by summing the probabilities for (1, 3), (2, 3), and (3, 3) as follows: \(P(Y=3) = p(1,3) + p(2,3) + p(3,3) = 0 + \frac{1}{6} + \frac{1}{9}\)
02

Calculate the conditional probability P(X=x | Y=i) for each value of i

Now, we will calculate the conditional probability for each combination using the formula: \(P(X=x \mid Y=i) = \frac{p(x,i)}{P(Y=i)}\) For Y=1: \(P(X=1 \mid Y=1) = \frac{p(1,1)}{P(Y=1)}\) \(P(X=2 \mid Y=1) = \frac{p(2,1)}{P(Y=1)}\) \(P(X=3 \mid Y=1) = \frac{p(3,1)}{P(Y=1)}\) For Y=2: \(P(X=1 \mid Y=2) = \frac{p(1,2)}{P(Y=2)}\) \(P(X=2 \mid Y=2) = \frac{p(2,2)}{P(Y=2)}\) \(P(X=3 \mid Y=2) = \frac{p(3,2)}{P(Y=2)}\) For Y=3: \(P(X=1 \mid Y=3) = \frac{p(1,3)}{P(Y=3)}\) \(P(X=2 \mid Y=3) = \frac{p(2,3)}{P(Y=3)}\) \(P(X=3 \mid Y=3) = \frac{p(3,3)}{P(Y=3)}\)
03

Compute the conditional expectation E[X | Y=i]

Now we will compute the conditional expectation for each Y=i using the following formula: \(E[X \mid Y=i] = \sum_{x} x \cdot P(X=x \mid Y=i)\) For Y=1: \(E[X \mid Y=1] = 1 \cdot P(X=1 \mid Y=1) + 2 \cdot P(X=2 \mid Y=1) + 3 \cdot P(X=3 \mid Y=1)\) For Y=2: \(E[X \mid Y=2] = 1 \cdot P(X=1 \mid Y=2) + 2 \cdot P(X=2 \mid Y=2) + 3 \cdot P(X=3 \mid Y=2)\) For Y=3: \(E[X \mid Y=3] = 1 \cdot P(X=1 \mid Y=3) + 2 \cdot P(X=2 \mid Y=3) + 3 \cdot P(X=3 \mid Y=3)\) Using the conditional probabilities calculated in Step 2, compute the conditional expectations for each value of Y (Y=1,2,3).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Polya's urn model supposes that an urn initially contains \(r\) red and \(b\) blue balls. At each stage a ball is randomly selected from the urn and is then returned along with \(m\) other balls of the same color. Let \(X_{k}\) be the number of red balls drawn in the first \(k\) selections. (a) Find \(E\left[X_{1}\right]\) (b) Find \(E\left[X_{2}\right]\). (c) Find \(E\left[X_{3}\right]\). (d) Conjecture the value of \(E\left[X_{k}\right]\), and then verify your conjecture by a conditioning argument. (e) Give an intuitive proof for your conjecture. Hint: Number the initial \(r\) red and \(b\) blue balls, so the urn contains one type \(i\) red ball, for each \(i=1, \ldots, r ;\) as well as one type \(j\) blue ball, for each \(j=1, \ldots, b\). Now suppose that whenever a red ball is chosen it is returned along with \(m\) others of the same type, and similarly whenever a blue ball is chosen it is returned along with \(m\) others of the same type. Now, use a symmetry argument to determine the probability that any given selection is red.

An individual traveling on the real line is trying to reach the origin. However, the larger the desired step, the greater is the variance in the result of that step. Specifically, whenever the person is at location \(x\), he next moves to a location having mean 0 and variance \(\beta x^{2}\). Let \(X_{n}\) denote the position of the individual after having taken \(n\) steps. Supposing that \(X_{0}=x_{0}\), find (a) \(E\left[X_{n}\right]\); (b) \(\operatorname{Var}\left(X_{n}\right)\)

In Section 3.6.3, we saw that if \(U\) is a random variable that is uniform on \((0,1)\) and if, conditional on \(U=p, X\) is binomial with parameters \(n\) and \(p\), then $$ P\\{X=i\\}=\frac{1}{n+1}, \quad i=0,1, \ldots, n $$ For another way of showing this result, let \(U, X_{1}, X_{2}, \ldots, X_{n}\) be independent uniform \((0,1)\) random variables. Define \(X\) by \(X=\\# i: X_{i}

A deck of \(n\) cards, numbered 1 through \(n\), is randomly shuffled so that all \(n !\) possible permutations are equally likely. The cards are then turned over one at a time until card number 1 appears. These upturned cards constitute the first cycle. We now determine (by looking at the upturned cards) the lowest numbered card that has not yet appeared, and we continue to turn the cards face up until that card appears. This new set of cards represents the second cycle. We again determine the lowest numbered of the remaining cards and turn the cards until it appears, and so on until all cards have been turned over. Let \(m_{n}\) denote the mean number of cycles. (a) Derive a recursive formula for \(m_{n}\) in terms of \(m_{k}, k=1, \ldots, n-1\). (b) Starting with \(m_{0}=0\), use the recursion to find \(m_{1}, m_{2}, m_{3}\), and \(m_{4}\). (c) Conjecture a general formula for \(m_{n}\). (d) Prove your formula by induction on \(n\). That is, show it is valid for \(n=1\), then assume it is true for any of the values \(1, \ldots, n-1\) and show that this implies it is true for \(n\). (e) Let \(X_{i}\) equal 1 if one of the cycles ends with card \(i\), and let it equal 0 otherwise, \(i=1, \ldots, n\). Express the number of cycles in terms of these \(X_{i}\). (f) Use the representation in part (e) to determine \(m_{n}\). (g) Are the random variables \(X_{1}, \ldots, X_{n}\) independent? Explain. (h) Find the variance of the number of cycles.

Suppose that we want to predict the value of a random variable \(X\) by using one of the predictors \(Y_{1}, \ldots, Y_{n}\), each of which satisfies \(E\left[Y_{i} \mid X\right]=X .\) Show that the predictor \(Y_{i}\) that minimizes \(E\left[\left(Y_{i}-X\right)^{2}\right]\) is the one whose variance is smallest. Hint: Compute \(\operatorname{Var}\left(Y_{i}\right)\) by using the conditional variance formula.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free