Chapter 11: Problem 9
Set up the alias method for simulating from a binomial random variable with parameters \(n=6, p=0.4\)
Chapter 11: Problem 9
Set up the alias method for simulating from a binomial random variable with parameters \(n=6, p=0.4\)
All the tools & learning materials you need for study success - in one app.
Get started for freeSuppose we want to simulate a large number \(n\) of independent exponentials
with rate \(1-\) call them \(X_{1}, X_{2}, \ldots, X_{n} .\) If we were to employ
the inverse transform technique we would require one logarithmic computation
for each exponential generated. One way to avoid this is to first simulate
\(S_{n}\), a gamma random variable with parameters \((n, 1)\) (say, by the method
of Section 11.3.3). Now interpret \(S_{n}\) as the time of the \(n\) th event of a
Poisson process with rate 1 and use the result that given \(S_{n}\) the set of
the first \(n-1\) event times is distributed as the set of \(n-1\) independent
uniform \(\left(0, S_{n}\right)\) random variables. Based on this, explain why
the following algorithm simulates \(n\) independent exponentials:
Step 1: Generate \(S_{n}\), a gamma random variable with parameters \((n, 1)\).
Step 2: Generate \(n-1\) random numbers \(U_{1}, U_{2}, \ldots, U_{n-1}\). Step 3:
Order the \(U_{i}, i=1, \ldots, n-1\) to obtain
\(U_{(1)}
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}\).
Consider a queueing system in which each service time, independent of the past, has mean \(\mu\). Let \(W_{n}\) and \(D_{n}\) denote, respectively, the amounts of time customer \(n\) spends in the system and in queue. Hence, \(D_{n}=W_{n}-S_{n}\) where \(S_{n}\) is the service time of customer \(n\). Therefore, $$ E\left[D_{n}\right]=E\left[W_{n}\right]-\mu $$
Consider the following procedure for randomly choosing a subset of size \(k\)
from the numbers \(1,2, \ldots, n:\) Fix \(p\) and generate the first \(n\) time
units of a renewal process whose interarrival distribution is geometric with
mean \(1 / p-\) that is, \(P\\{\) interarrival time \(=k\\}=p(1-p)^{k-1}, k=1,2,
\ldots .\) Suppose events occur at times \(i_{1}
If \(U_{1}, U_{2}, U_{3}\) are independent uniform \((0,1)\) random variables, find \(P\left(\prod_{i=1}^{3} U_{i}>0.1\right)\) Hint: Relate the desired probability to one about a Poisson process.
What do you think about this solution?
We value your feedback to improve our textbook solutions.