Three students are working independently on their Stat 110 problem set. All three start at 1pm on the day the pset is due, and each takes an Exponential time with mean 6 hours to complete the homework.
What is the earliest time when all three students will have completed the homework, on average?
Label the students, and let Xi be the amount of time it takes student i to finish the pset. Let T be the total amount of time it takes for all three students to finish, and let T=T1+T2+T3, where T1=min(X1,X2,X3), and so on. We know that T1∼Expo(63), as we showed in the previous problem set, T2∼Expo(62), and T3∼Expo(61). Therefore,
E[T]=2+3+6=11
Counting Cars
Cars pass by a certain point on a road according to a Poisson process with rate λ cars/minute. Let Nt∼Pois(λt) be the number of cars that pass by that point in the time interval [0,t], with t measured in minutes.
A certain device is able to count cars as they pass by, but it does not record the arrival times. At time 0, the counter on the device is reset to 0. At time 3 minutes, the device is observed and it is found that exactly 1 car had passed by.
Given this information, find the conditional CDF of when that car arrived. Also describe in words what the result says.
Let T1 be the arrival time of the first car to arrive after time 0. Unconditionally, T1∼Expo(λ). Given N3=1, for 0≤t≤3, we have P(T1≤t∣N3=1)=P(Nt≥1∣N3=1)=P(N3=1)P(Nt≥1,N3=1)=P(N3=1)P(Nt=1,N3=1) By definition of the Poisson process, the numerator is
for 0≤t≤3 (and 0 for t<0 and 1 for t>3). This says that the conditional distribution of the first arrival time, given that there was exactly one arrival in [0,3], is Unif(0,3).
In the late afternoon, you are counting blue cars. Each car that passes by is blue with probability $b$, independently of all other cars.
Find the marginal PMF of the number of blue cars and number of non-blue cars that pass by the point in 10 minutes.
Let X and Y be the number of blue and non-blue cars that pass by in those 10 minutes respectively, and N=X+Y. Then N∼Pois(10λ) and X∣N∼Bin(N,b). By the chicken-egg story, X and Y are independent with
X∼Pois(10λb)
Y∼Pois(10λ(1−b))
Find the joint PMF of the number of blue cars and number of non-blue cars that pass by the point in 10 minutes.
The joint PMF is the product of the marginal PMFs:
Use the MGF to show that for any values of a,b=0, Y=aX1+bX2 is also Normal. (You may use the fact that the MGF of a N(μ,σ2) distribution is eμt+21σ2t2.)
We know that the MGF for the sum of 2 independent random variables is the product of their individual MGFs. We also know that the MGF of a scalar c times a random variable is equal to that random variable's MGF with ct subsituted for t.
Let Z∼N(0,1) and Y=eZ. Then Y has a LogNormal distribution (because its log is Normal!).
Find all the moments of Y. That is, find E(Yn) for all n.
Using exponent rules,
E(Yn)=E((eZ)n)=E(enZ)
We may be tempted to use LOTUS at this point, but it is easier to recognize that E(enZ) is the MGF of Z, evaluated at t=n. In other words, E(enZ)=MZ(n). Since MZ(t)=et2/2, we conclude that MZ(n)=en2/2.
Show the MGF of Y does not exist, by arguing that the integral E(etY) diverges for t>0.
The key is to remember that the MGF is an expectation, which requires LOTUS and integration:
Suppose t>0. Then as z grows larger, tez will grow at a faster rate than z2/2. Hence, tez−z2/2 will explode. Therefore, the integral diverges for all t>0. Since E(etY) is not finite on an open interval around 0, the MGF of Y does not exist.