Chapter 3: Problem 11
The joint density of \(X\) and \(Y\) is
$$
f(x, y)=\frac{\left(y^{2}-x^{2}\right)}{8} e^{-y}, \quad 0
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 3: Problem 11
The joint density of \(X\) and \(Y\) is
$$
f(x, y)=\frac{\left(y^{2}-x^{2}\right)}{8} e^{-y}, \quad 0
All the tools & learning materials you need for study success - in one app.
Get started for free
A rat is trapped in a maze. Initially it has to choose one of two directions. If it goes to the right, then it will wander around in the maze for three minutes and will then return to its initial position. If it goes to the left, then with probability \(\frac{1}{3}\) it will depart the maze after two minutes of traveling, and with probability \(\frac{2}{3}\) it will return to its initial position after five minutes of traveling. Assuming that the rat is at all times equally likely to go to the left or the right, what is the expected number of minutes that it will be trapped in the maze?
The number of red balls in an urn that contains \(n\) balls is a random variable that is equally likely to be any of the values \(0,1, \ldots, n\). That is, $$ P\\{i \text { red, } n-i \text { non-red }\\}=\frac{1}{n+1}, \quad i=0, \ldots, n $$ The \(n\) balls are then randomly removed one at a time. Let \(Y_{k}\) denote the number of red balls in the first \(k\) selections, \(k=1, \ldots, n\). (a) Find \(P\left\\{Y_{n}=j\right\\}, j=0, \ldots, n\). (b) Find \(P\left\\{Y_{n-1}=j\right\\}, j=0, \ldots, n\). (c) What do you think is the value of \(P\left\\{Y_{k}=j\right\\}, j=0, \ldots, n ?\) (d) Verify your answer to part (c) by a backwards induction argument. That is, check that your answer is correct when \(k=n\), and then show that whenever it is true for \(k\) it is also true for \(k-1, k=1, \ldots, n\).
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)\).
An urn contains \(n\) balls, with ball \(i\) having weight \(w_{i}, i=1, \ldots, n .\) The balls are withdrawn from the urn one at a time according to the following scheme: When \(S\) is the set of balls that remains, ball \(i, i \in S\), is the next ball withdrawn with probability \(w_{i} / \sum_{j \in S} w_{j} .\) Find the expected number of balls that are withdrawn before ball \(i, i=1, \ldots, n\).
The joint density of \(X\) and \(Y\) is given by
$$
f(x, y)=\frac{e^{-x / y} e^{-y}}{y}, \quad 0
What do you think about this solution?
We value your feedback to improve our textbook solutions.