The fundamental counting process for modeling rare events in continuous time
A counting process is a Poisson process with rate if:
The inter-arrival times are i.i.d. exponential(): .
and .
The superposition of independent Poisson processes with rates is a Poisson process with rate .
If each event in a Poisson() process is independently classified into category with probability , then each resulting sub-process is an independent Poisson process with rate .
Problem:
For a Poisson process with rate events/hour, find .
Solution:
.
Problem:
Two independent Poisson processes have rates and . What is the rate of their superposition?
Solution:
The superposition is a Poisson process with rate .
Problem:
Customers arrive at rate per hour. 30% buy coffee. What is the rate of the coffee purchase process?
Solution:
By thinning, the coffee purchase process is Poisson with rate per hour.
The exponential distribution is the only continuous memoryless distribution. Since the Poisson process has independent increments (the memoryless property), and events occur at a constant rate λ, the time until the next event must follow an exponential distribution with parameter λ. This is a direct consequence of the process's fundamental properties.
A homogeneous Poisson process has a constant rate λ(t) = λ, meaning events occur at the same average rate over time. A non-homogeneous (or inhomogeneous) process has a time-varying rate λ(t), allowing the intensity to change—like modeling rush hour traffic where the arrival rate increases during peak hours.
If you have k independent Poisson processes with rates λ₁, λ₂, ..., λₖ, their superposition (sum) is also a Poisson process with rate λ₁ + λ₂ + ... + λₖ. This is powerful for modeling: if two independent service centers generate customers at rates 3/hr and 5/hr, the combined arrival stream is Poisson with rate 8/hr.
Thinning (or decomposition) is when you independently classify each event in a Poisson(λ) process into categories with probabilities p₁, p₂, ..., pₖ. Each resulting sub-process is an independent Poisson process with rate λpᵢ. For example, if customers arrive at rate 10/hr and 30% buy coffee, the coffee purchase process is Poisson(3).
This gives the probability of no events in time [0,t]. It's fundamental for reliability theory (probability a component survives time t without failure) and queuing theory (probability a server remains idle). It's also the starting point for deriving the full Poisson distribution recursively.