Chapter 5: Problem 10
Let \(X\) and \(Y\) be independent exponential random variables with respective rates \(\lambda\) and \(\mu\). Let \(M=\min (X, Y)\). Find (a) \(E[M X \mid M=X]\) (b) \(E[M X \mid M=Y]\) (c) \(\operatorname{Cov}(X, M)\)
Chapter 5: Problem 10
Let \(X\) and \(Y\) be independent exponential random variables with respective rates \(\lambda\) and \(\mu\). Let \(M=\min (X, Y)\). Find (a) \(E[M X \mid M=X]\) (b) \(E[M X \mid M=Y]\) (c) \(\operatorname{Cov}(X, M)\)
All the tools & learning materials you need for study success - in one app.
Get started for freeThe water level of a certain reservoir is depleted at a constant rate of 1000 units daily. The reservoir is refilled by randomly occurring rainfalls. Rainfalls occur according to a Poisson process with rate \(0.2\) per day. The amount of water added to the reservoir by a rainfall is 5000 units with probability \(0.8\) or 8000 units with probability \(0.2 .\) The present water level is just slightly below 5000 units. (a) What is the probability the reservoir will be empty after five days? (b) What is the probability the reservoir will be empty sometime within the next ten days?
Suppose that the number of typographical errors in a new text is Poisson distributed with mean \(\lambda\). Two proofreaders independently read the text. Suppose that each error is independently found by proofreader \(i\) with probability \(p_{i}, i=1,2 .\) Let \(X_{1}\) denote the number of errors that are found by proofreader 1 but not by proofreader \(2 .\) Let \(X_{2}\) denote the number of errors that are found by proofreader 2 but not by proofreader \(1 .\) Let \(X_{3}\) denote the number of errors that are found by both proofreaders. Finally, let \(X_{4}\) denote the number of errors found by neither proofreader. (a) Describe the joint probability distribution of \(X_{1}, X_{2}, X_{3}, X_{4}\). (b) Show that $$ \frac{E\left[X_{1}\right]}{E\left[X_{3}\right]}=\frac{1-p_{2}}{p_{2}} \text { and } \frac{E\left[X_{2}\right]}{E\left[X_{3}\right]}=\frac{1-p_{1}}{p_{1}} $$ Suppose now that \(\lambda, p_{1}\), and \(p_{2}\) are all unknown. (c) By using \(X_{i}\) as an estimator of \(E\left[X_{i}\right], i=1,2,3\), present estimators of \(p_{1}, p_{2}\) and \(\lambda\). (d) Give an estimator of \(X_{4}\), the number of errors not found by either proofreader.
For the conditional Poisson process, let \(m_{1}=E[L], m_{2}=E\left[L^{2}\right] .\) In terms of \(m_{1}\) and \(m_{2}\), find \(\operatorname{Cov}(N(s), N(t))\) for \(s \leqslant t .\)
A flashlight needs two batteries to be operational. Consider such a flashlight along with a set of \(n\) functional batteries-battery 1 , battery \(2, \ldots\), battery \(n .\) Initially, battery 1 and 2 are installed. Whenever a battery fails, it is immediately replaced by the lowest numbered functional battery that has not yet been put in use. Suppose that the lifetimes of the different batteries are independent exponential random variables each having rate \(\mu .\) At a random time, call it \(T\), a battery will fail and our stockpile will be empty. At that moment exactly one of the batteries-which we call battery \(X\) -will not yet have failed. (a) What is \(P[X=n\\}\) ? (b) What is \(P[X=1\\} ?\) (c) What is \(P[X=i\\} ?\) (d) Find \(E[T]\). (e) What is the distribution of \(T ?\)
Events occur according to a Poisson process with rate \(\lambda .\) Each time an event occurs, we must decide whether or not to stop, with our objective being to stop at the last event to occur prior to some specified time \(T\), where \(T>1 / \lambda\). That is, if an event occurs at time \(t, 0 \leqslant t \leqslant T\), and we decide to stop, then we win if there are no additional events by time \(T\), and we lose otherwise. If we do not stop when an event occurs and no additional events occur by time \(T\), then we lose. Also, if no events occur by time \(T\), then we lose. Consider the strategy that stops at the first event to occur after some fixed time \(s, 0 \leqslant s \leqslant T\). (a) Using this strategy, what is the probability of winning? (b) What value of \(s\) maximizes the probability of winning? (c) Show that one's probability of winning when using the preceding strategy with the value of \(s\) specified in part (b) is \(1 / e\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.