Академический Документы
Профессиональный Документы
Культура Документы
MTH 412
Applied Stochastic Process
4. Let f (x) and g(x) be probability density functions, and suppose that for some constant
c, f (x) cg(x) for all x. Suppose we can generate random variables having density
function g(x), and consider the following algorithm.
Step 1: Generate Y , a random variable having density function g(x).
Step 2: Generate U , a uniform (0,1) random variable
y(Y )
Step 3: If U , set X = Y . Otherwise go back to Step 1.
cg(Y )
Show that X has the density function f (x).
5. Generate a random sample from the following probability density function, for known
0 < < 1.
1 1 x
f (x) = x e ; x > 0.
()
6. Busses arrive at a certain stop according to a Poisson process with rate . If you take
a bus from that stop then it takes a time R, measured from the time at which you
entered the bus to arrive home. If you walk from the bus stop then it takes time W to
arrive home. Suppose that your policy when arriving at the bus stop is to wait up to
time s, and if the bus has not arrived by that time then you walk home.
(a) Compute the expected time from when you arrive at the bus stop until you reach
home.
(b) Find s so that the expected time is minimized.