Chapter 11: Problem 2
Give a method for simulating a negative binomial random variable.
Chapter 11: Problem 2
Give a method for simulating a negative binomial random variable.
All the tools & learning materials you need for study success - in one app.
Get started for freeThe Discrete Rejection Metbod: Suppose we want to simulate \(X\) having probability mass function \(P\\{X=i\\}=P_{i}, i=1, \ldots, n\) and suppose we can easily simulate from the probability mass function \(Q_{i}, \sum_{i} Q_{i}=1, Q_{i} \geqslant 0 .\) Let \(C\) be such that \(P_{i} \leqslant C Q_{i}, i=1, \ldots, n .\) Show that the following algorithm generates the desired random variable: Step 1: Generate \(Y\) having mass function \(Q\) and \(U\) an independent random number. Step \(2:\) If \(U \leqslant P_{Y} / C Q_{Y}\), set \(X=Y .\) Otherwise return to step \(1 .\)
Verify that if we use the hazard rate approach to simulate the event times of a nonhomogeneous Poisson process whose intensity function \(\lambda(t)\) is such that \(\lambda(t) \leqslant \lambda\), then we end up with the approach given in method 1 of Section \(11.5\).
Suppose \(n\) balls having weights \(w_{1}, w_{2}, \ldots, w_{n}\) are in an urn. These balls are sequentially removed in the following manner: At each selection, a given ball in the urn is chosen with a probability equal to its weight divided by the sum of the weights of the other balls that are still in the urn. Let \(I_{1}, I_{2}, \ldots, I_{n}\) denote the order in which the balls are removed-thus \(I_{1}, \ldots, I_{n}\) is a random permutation with weights. (a) Give a method for simulating \(I_{1}, \ldots, I_{n}\). (b) Let \(X_{i}\) be independent exponentials with rates \(w_{i}, i=1, \ldots, n .\) Explain how \(X_{i}\) can be utilized to simulate \(I_{1}, \ldots, I_{n}\).
Order Statistics: Let \(X_{1}, \ldots, X_{n}\) be i.i.d. from a continuous
distribution \(F\), and let \(X_{(i)}\) denote the \(i\) th smallest of \(X_{1},
\ldots, X_{n}, i=1, \ldots, n\). Suppose we want to simulate
\(X_{(1)}
Give an algorithm for simulating a random variable having density function
$$
f(x)=30\left(x^{2}-2 x^{3}+x^{4}\right), \quad 0
What do you think about this solution?
We value your feedback to improve our textbook solutions.