Define a Poisson process and state at least three applications of the same.
5 marks · directive: Define
The core of a good answer
A counting process {N(t), t ≥ 0} is a Poisson process with rate λ if N(0) = 0, it has independent and stationary increments, and N(t + h) − N(t) ~ Poisson(λh), equivalently P(one event in (t, t + h]) = λh + o(h) and P(two or more) = o(h); its inter-arrival times are independent exponential with mean 1/λ, and it models arrivals at queues, radioactive decay counts, insurance claims, telephone calls and equipment failures.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
State the definition (either the axiomatic form or the Poisson-increment form) clearly, mention the exponential inter-arrival property, then give at least three applications with a line each.
Answer outline
Introduction
The Poisson process is the basic model for events occurring randomly and independently in continuous time at a constant average rate.
Definition
- N(0) = 0.
- Independent increments: counts in disjoint intervals are independent.
- Stationary increments: the distribution of N(t + s) − N(s) depends only on t.
- P[N(t) = k] = e^(−λt)(λt)^k/k!, k = 0, 1, 2, ..., so E N(t) = Var N(t) = λt.
- Equivalent: P[N(h) = 1] = λh + o(h), P[N(h) ≥ 2] = o(h).
Key properties
- Inter-arrival times are i.i.d. exponential(λ); the waiting time to the nth event is gamma(n, λ).
- Superposition of independent Poisson processes is Poisson; random thinning keeps the Poisson property.
Applications
- Queueing: arrivals of customers at a bank or post office (the M in M/M/1).
- Physics: emissions from a radioactive source counted by a Geiger counter.
- Insurance: arrival of claims (Lundberg, 1903).
- Telecommunications: calls arriving at an exchange or packets at a router.
- Reliability: failures of a repairable system with constant failure rate.
Conclusion
A Poisson process is the counting process with independent, stationary, Poisson-distributed increments; its memoryless exponential gaps make it the standard model for random arrivals in queueing, insurance, physics and reliability.
Examples and data to cite
- Bortkiewicz's data on deaths from horse kicks in the Prussian army, at the end of the 19th century, are an early example of Poisson counts.
- Erlang (1909) derived the Poisson distribution for the number of incoming telephone calls in a fixed time interval.
Facts to remember
- N(t) ~ Poisson(λt); mean = variance = λt.
- Inter-arrival times are exponential with mean 1/λ.
- Independent and stationary increments.
- Memoryless property of the exponential distribution.