Chapter 10: Q. 10.11 (page 431)
Use the rejection method with g(x) = 1, 0 < x < 1, to determine an algorithm for simulating a random variable having density function
Short Answer
The algorithm is generate(which is unform) and take random number.
Chapter 10: Q. 10.11 (page 431)
Use the rejection method with g(x) = 1, 0 < x < 1, to determine an algorithm for simulating a random variable having density function
The algorithm is generate(which is unform) and take random number.
All the tools & learning materials you need for study success - in one app.
Get started for freePresent a method for simulating a random variable having distribution function
In Example 2c we simulated the absolute value of a unit normal by using the rejection procedure on exponential random variables with rate 1. This raises the question of whether we could obtain a more efficient algorithm by using a different exponential density—that is, we could use the density g(x) = λe−λx. Show that the mean number of iterations needed in the rejection scheme is minimized when λ = 1.
Suppose we have a method for simulating random variables from the distributions F1 and F2. Explain how to simulate from the distribution
F(x) = pF1(x) + (1 − p)F2(x) 0 < p < 1
Give a method for simulating from
Suppose it is relatively easy to simulate from Fi for each i = 1, ... , n. How can we simulate from
(a)
(b)
Develop a technique for simulating a random variable having density function
What do you think about this solution?
We value your feedback to improve our textbook solutions.