Chapter 10: Q. 10.3 (page 431)
Give an efficient algorithm to simulate the value of a random variable with probability mass function
p1 = .15 p2 = .2 p3 = .35 p4 = .30
Short Answer
The algorithm is define
Chapter 10: Q. 10.3 (page 431)
Give an efficient algorithm to simulate the value of a random variable with probability mass function
p1 = .15 p2 = .2 p3 = .35 p4 = .30
The algorithm is define
All the tools & learning materials you need for study success - in one app.
Get started for freeIn 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.
Let (X, Y) be uniformly distributed in the circle of radius 1 centered at the origin. Its joint density is thus
Let R = (X2 + Y2)1/2 and = tanโ1(Y/X) denote
the polar coordinates of (X, Y). Show that R and are
independent, with R2 being uniform on (0, 1) and being
uniform on (0, 2ฯ).
Let X be a random variable on (0, 1) whose density is f(x). Show that we can estimate # 1 0 g(x) dx by simulating X and then taking g(X)/f(X) as our estimate. This method, called importance sampling, tries to choose f similar in shape to g, so that g(X)/f(X) has a small variance.
The following algorithm will generate a random permutation of the elements 1, 2, ... , n. It is somewhat faster than the one presented in Example 1a but is such that no position is fixed until the algorithm ends. In this algorithm, P(i) can be interpreted as the element in position i. Step 1. Set k = 1. Step 2. Set P(1) = 1. Step 3. If k = n, stop. Otherwise, let k = k + 1. Step 4. Generate a random number U and let P(k) = P([kU] + 1) P([kU] + 1) = k Go to step 3. (a) Explain in words what the algorithm is doing. (b) Show that at iteration kโthat is, when the value of P(k) is initially setโP(1),P(2), ... ,P(k) is a random permutation of 1, 2, ... , k.
Give an approach for simulating a random variable having probability density function
f(x) = 30(x2 โ 2x3 + x4) 0 < x < 1
What do you think about this solution?
We value your feedback to improve our textbook solutions.