Eq. (1.15) — exponential interarrival times give a Poisson number of arrivals
ProvedQueueingFundamentals.Foundations.poisson_count_cdfexponential-distributionp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-processqueueing
Let be independent exponential interarrival times with rate , and let be the number of arrivals in . Then for every and every the distribution function satisfies
and consequently
The integral is the tail of the Erlang (gamma) distribution of the sum of interarrival times, Eq. (1.15); the sum is the Poisson distribution function. This is the converse of the derivation of the exponential interarrival law from the Poisson process.
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_Foundations_ArrivalProcess open MeasureTheory ProbabilityTheory
Formal statement
namespace QueueingFundamentals.Foundations
/-- Eq. (1.15) and the Poisson CDF (pp.18–19): with independent `Exp(λ)` interarrival times, the
number of arrivals `N(t)` by time `t ≥ 0` satisfies
`P_n(t) = Pr{N(t) ≤ n} = ∫_t^∞ λ(λx)^n e^{-λx}/n! dx = ∑_{i=0}^n (λt)^i e^{-λt}/i!`,
and hence `Pr{N(t) = n} = (λt)^n e^{-λt}/n!`. -/
theorem poisson_count_cdf {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
[IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
(hT : IsExpInterarrivals μ lam T) (n : ℕ) (t : ℝ) (ht : 0 ≤ t) :
(μ {ω | countingProcess T t ω ≤ n}).toReal =
∫ x in Set.Ioi t, lam * (lam * x) ^ n / (n.factorial : ℝ) * Real.exp (-(lam * x)) ∧
(μ {ω | countingProcess T t ω ≤ n}).toReal =
∑ i ∈ Finset.range (n + 1), (lam * t) ^ i * Real.exp (-(lam * t)) / (i.factorial : ℝ) ∧
(μ {ω | countingProcess T t ω = n}).toReal =
(lam * t) ^ n / (n.factorial : ℝ) * Real.exp (-(lam * t)) := by sorry
end QueueingFundamentals.Foundations
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.18–19, Eq. (1.15) and the Poisson CDF following it
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.