4.3 Interarrival and Waiting Times

Let \(T_1\) be the time of the first event and, for \(n\geq 2\), \(T_n\) the time between the \((n - 1)\)th and \(n\)th events. The \(T_n\) are the interarrival times. The waiting time until the \(n\)th event is \(S_n = T_1 + \cdots + T_n\).

Theorem 4.3.1. The interarrival times \(T_1, T_2, \dots \) are independent exponential random variables with mean \(\frac 1\lambda \), and \(S_n\) has the gamma density \[f_{S_n}(t) = \frac {\lambda e^{-\lambda t}(\lambda t)^{n-1}}{(n - 1)!},\qquad t>0 .\]

Proof. \(P(T_1>t) = P(N(t) = 0) = e^{-\lambda t}\), so \(T_1\) is exponential with rate \(\lambda \). Given \(T_1 = s\), the event \(T_2>t\) means no events in \((s, s + t]\), which by independent and stationary increments has probability \(e^{-\lambda t}\) whatever \(s\) is; so \(T_2\) is exponential and independent of \(T_1\), and the same argument applies to each later \(T_n\).

For \(S_n\): the \(n\)th event has occurred by time \(t\) exactly when at least \(n\) events have occurred in \((0, t]\), so \[F_{S_n}(t) = P(N(t)\geq n) = \sum _{j=n}^\infty \frac {e^{-\lambda t}(\lambda t)^j}{j!} .\] Differentiating term by term, \[f_{S_n}(t) = \sum _{j=n}^\infty \left [\frac {\lambda e^{-\lambda t}(\lambda t)^{j-1}}{(j - 1)!} - \frac {\lambda e^{-\lambda t}(\lambda t)^j}{j!}\right ],\] a telescoping sum in which everything cancels except the first term, \(\frac {\lambda e^{-\lambda t}(\lambda t)^{n-1}}{(n - 1)!}\). □

So a Poisson process can be built by laying down independent exponential gaps, and \(E(S_n) = \frac n\lambda \). The exponential distribution is memoryless, \(P(T>s + t\mid T>s) = P(T>t)\), which is the continuous-time face of the Markov property: at any moment the time to the next event is exponential with rate \(\lambda \), however long it has been since the last one.

Example 4.3.2. People immigrate into a territory as a Poisson process with rate \(\lambda = 1\) per day.

(a)
What is the expected time until the tenth immigrant arrives?
(b)
What is the probability that more than two days elapse between the tenth and eleventh arrivals?
(c)
What is the probability that exactly three immigrants arrive in a given week, and that at least one arrives in a given day?

Solution.

(a)
\(E(S_{10}) = \frac {10}{\lambda } = 10\) days.
(b)
The gap \(T_{11}\) is exponential with rate \(1\), so \(P(T_{11}>2) = e^{-2} = 0.135\).
(c)
\(N(7)\) is Poisson with mean \(7\), so \(P(N(7) = 3) = \frac {e^{-7}7^3}{3!} = 0.052\), and \(P(N(1)\geq 1) = 1 - e^{-1} = 0.632\).

Example 4.3.3. The time to repair a machine is exponential with mean \(\frac 12\) hour. What is the probability that a repair takes more than \(\frac 12\) hour? Given that a repair has already taken \(2\) hours, what is the probability that it takes at least another \(\frac 12\) hour?

Solution. The rate is \(\lambda = 2\), so \(P(X>\frac 12) = e^{-2\cdot \frac 12} = e^{-1} = 0.368\). By the memoryless property the answer to the second question is the same, \(0.368\): an exponential repair that is still going on is as good as new.

Questions on this section

Stuck on something here? Ask below and it stays attached to this topic.