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)\)
/*! 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 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 free
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.
Consider a single server queuing system where customers arrive according to a Poisson process with rate \(\lambda\), service times are exponential with rate \(\mu\), and customers are served in the order of their arrival. Suppose that a customer arrives and finds \(n-1\) others in the system. Let \(X\) denote the number in the system at the moment that customer departs. Find the probability mass function of \(X\). Hint: Relate this to a negative binomial random variable.
Suppose that customers arrive to a system according to a Poisson process with rate \(\lambda\). There are an infinite number of servers in this system so a customer begins service upon arrival. The service times of the arrivals are independent exponential random variables with rate \(\mu\), and are independent of the arrival process. Customers depart the system when their service ends. Let \(N\) be the number of arrivals before the first departure. (a) Find \(P(N=1)\). (b) Find \(P(N=2)\) (c) Find \(P(N=j)\). (d) Find the probability that the first to arrive is the first to depart. (e) Find the expected time of the first departure.
An average of 500 people pass the California bar exam each year. A California lawyer practices law, on average, for 30 years. Assuming these numbers remain steady, how many lawyers would you expect California to have in \(2050 ?\)
The lifetime of a radio is exponentially distributed with a mean of ten years. If Jones buys a ten-year-old radio, what is the probability that it will be working after an additional ten years?
What do you think about this solution?
We value your feedback to improve our textbook solutions.