Generate E ∼ Exp(

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Suppose that g is an easy probability density function to generate from, and h is a nonnegative function. Consider the following algorithm pseudo-code:


Step 1. Generate Y ∼ g.

Step 2. Generate E ∼ Exp(1) in the way that E = − log(U), U ∼ Unif(0, 1).

Step 3. If E ≥ h(Y ), set X = Y . Otherwise go to Step 1.

Step 4. Return X.
This is a rejection algorithm and we want to find the density function of the generated
samples.


(a) Note that E ∼ Exp(1). What is the probability that P(E ≤ t) for any constant
t > 0?
(b) Given Y = x, what is the probability that Y will be accepted?


(c) What is the joint probability that P(Y ≤ x, Y is accepted)?

(d) Note that the density function f(x) in the samples is the conditional prob. f(x|accepted).
Find f for X, subject to a constant.(e) With the results, write the pseudo-code for the density
f(x) = c/x2 * e-(x^2)/2, x>1
(Hint. Find g and h to generate f. For g, you may consider the inversion algorithm.)

 

I have the answers for part (a) and (b) already. Hence, I only need help for parts c, d and e. 

Suppose that g is an easy probability density function to generate from, and h is a non-
negative function. Take a close look at the following algorithm pseudo-code:
Step 1. Generate Y ~ g.
Step 2. Generate E -
Exp(1) in the way that E = – log(U), U ~ Unif(0, 1).
Step 3. If E > h(Y), set X = Y. Otherwise go to Step 1.
Step 4. Return X.
This is a rejection algorithm and we want to find the density function of the generated
samples.
(a) Note that E
t > 0?
Exp(1). What is the probability that P(E < t) for any constant
(b) Given Y = x, what is the probability that Y will be accepted?
(c) What is the joint probability that P(Y <x,Y is accepted)?
(d) Note that the density function f (x) in the samples is the conditional prob. f(r|accepted).
Find f for X, subject to a constant.
(e) With the results, write the pseudo-code for the density
f(r) =
2/2
x > 1.
(Hint. Find g and h to generate f. For g, you may consider the inversion algorithm.)
Transcribed Image Text:Suppose that g is an easy probability density function to generate from, and h is a non- negative function. Take a close look at the following algorithm pseudo-code: Step 1. Generate Y ~ g. Step 2. Generate E - Exp(1) in the way that E = – log(U), U ~ Unif(0, 1). Step 3. If E > h(Y), set X = Y. Otherwise go to Step 1. Step 4. Return X. This is a rejection algorithm and we want to find the density function of the generated samples. (a) Note that E t > 0? Exp(1). What is the probability that P(E < t) for any constant (b) Given Y = x, what is the probability that Y will be accepted? (c) What is the joint probability that P(Y <x,Y is accepted)? (d) Note that the density function f (x) in the samples is the conditional prob. f(r|accepted). Find f for X, subject to a constant. (e) With the results, write the pseudo-code for the density f(r) = 2/2 x > 1. (Hint. Find g and h to generate f. For g, you may consider the inversion algorithm.)
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,