Poisson Calculator
Poisson Calculator
The Poisson distribution models the number of times an event happens in a fixed interval of time or space when events occur independently and at a constant average rate. It is the go-to model for rare, random counts: calls arriving at a call center per minute, defects per meter of fabric, accidents per day at an intersection, or meteorites hitting a roof per year.
What makes the Poisson distribution distinctive is that it has a single parameter, lambda (λ), which is both the mean and the variance of the count. A higher λ means more events on average and also more spread. The distribution is always skewed right for small λ but becomes nearly symmetric and bell-shaped as λ grows large.
Our Poisson calculator asks for the average rate λ and a specific count k, then returns P(X = k) (exactly k events), P(X ≤ k) (k or fewer), and P(X ≥ k) (k or more). Because the mean equals the variance, the calculator also reports that shared value so you can compare the center and spread at a glance.
Introduced by Siméon Denis Poisson in 1837, the distribution bridges the gap between the binomial model (fixed number of trials) and continuous processes where trials are effectively infinite and the chance per trial is tiny. It remains central to queueing theory, reliability engineering, and epidemiology.
The equality of the mean and variance is the distribution's signature property and also its main limitation. Real count data, especially in biology and finance, often show more variability than the mean would predict; this overdispersion means the Poisson will understate the chance of large counts. When you observe that the sample variance greatly exceeds the sample mean, a negative binomial model is usually a better fit. Conversely, underdispersed data (variance below the mean) also violate the assumption.
A useful mental model is to think of the interval as a ribbon of time or space subdivided into an enormous number of tiny slices, each with a tiny probability of an event. The Poisson formula is the limit of the binomial as the number of slices grows and the per-slice probability shrinks, holding the expected total constant. This is why the Poisson approximates the binomial so well when n is large and p is small, and why it naturally describes rare events scattered across a continuum.
Enter the average rate λ (a non-negative number) and the number of events k (a non-negative integer). The calculator instantly returns the three probabilities and the shared mean/variance.
Example 1 — Call center. A support line receives an average of λ = 3 calls per minute. What is the probability of exactly 2 calls in a given minute? Enter λ = 3, k = 2. P(X = 2) ≈ 22.4%. The chance of 2 or fewer is about 42.3%.
Example 2 — Website errors. A server averages λ = 0.5 errors per hour. What is the probability of at least 1 error in an hour? Enter λ = 0.5, k = 1 and read P(X ≥ 1) ≈ 39.3%.
Edge cases. λ = 0 means no events ever occur, so P(X = 0) = 100% and all other probabilities are 0%. A negative λ is rejected. A very large λ (say 100) shifts the distribution toward a bell shape and the calculator still returns accurate values. k = 0 is valid and gives the probability of no events at all.
Example 3 — Rare defect. A process averages λ = 0.2 defects per batch. The chance of zero defects is e^(−0.2) ≈ 81.9%, and the chance of two or more is about 1.8%, so defects are rare but not impossible.
Example 4 — Bus arrivals. Buses average λ = 4 per hour. The probability of exactly 4 arrivals is about 19.5%, while 6 or more is about 21.1%. Planning staff for the busy case means preparing for outcomes well above the average.
Example 5 — Very large lambda. With λ = 50, the distribution is nearly normal with mean and variance 50. The calculator handles this without the factorial overflow that hand calculation would hit.
The Poisson probability mass function is:
where λ is the average rate, k is the count of interest, and k! is the factorial of k. The cumulative probabilities are sums of the mass function:
Manual Step-by-Step
For λ = 3, k = 2:
- λ² = 9; e^(−3) ≈ 0.04979; 2! = 2
- P(X = 2) = (9 × 0.04979) / 2 = 0.2240, or 22.40%
- P(X ≤ 2) = P(0) + P(1) + P(2) = 0.0498 + 0.1494 + 0.2240 = 0.4232, or 42.32%
The calculator evaluates the factorial and exponential with full precision, so you avoid rounding errors that accumulate in hand sums.
Probabilities for λ = 3
| k (events) | P(X = k) | P(X ≤ k) |
|---|---|---|
| 0 | 4.98% | 4.98% |
| 1 | 14.94% | 19.92% |
| 2 | 22.40% | 42.32% |
| 3 | 22.40% | 64.72% |
| 4 | 16.80% | 81.52% |
| 5 | 10.08% | 91.60% |
The table shows the probabilities peaking at k = 2 and k = 3 (both about 22%), then tailing off. The cumulative column confirms that about 82% of minutes see four or fewer calls when the average is three.
- Confirm events are independent and occur at a constant average rate before trusting the model.
- For rare events over a long interval, scale λ proportionally (doubling the time doubles the expected count).
- Use λ = np as an approximation to the binomial when n is large and p is small.
- When λ exceeds about 10, the Poisson is well approximated by a normal distribution with the same mean and variance.
- Keep k an integer; fractional event counts are not defined for this discrete distribution.
- Compare P(X ≥ k) against a threshold to decide whether an observed count is unusually high.
- When λ exceeds about 10, switch mentally to a normal approximation with the same mean and variance to sanity-check large-count results.
- Track the rate over time; a λ that drifts means the process is not stationary and the single-rate model no longer applies.
- Use the complement rule: P(X ≥ 1) = 1 − P(X = 0) = 1 − e^(−λ), a handy shortcut for "at least one event" questions.
- Report the interval length alongside λ, because a rate of 3 per minute is not the same as 3 per hour.
- Separate distinct event types into separate calculations; pooling them hides which process is driving the counts.
- For very small λ, expect mostly zeros; a run of zero observations is consistent with the model, not evidence against it.
- The Poisson assumes a constant rate; if the rate changes over time, the model misleads.
- Events must be independent. Clustering or inhibition (one event raising or lowering the next) violates the assumption.
- It cannot produce overdispersion, where real variance exceeds the mean; such data need a negative binomial model.
- Very small λ makes most counts zero, which can look like missing data rather than a valid pattern.
- The calculator gives probabilities only; it does not test whether an observed rate differs from a historical one.
- Rounding λ to a rough average hides uncertainty in the rate estimate itself.
The single number λ summarizes the entire process, so interpreting it correctly matters. A rate of 3 calls per minute does not mean exactly 3 calls arrive every minute; it means the average over many minutes is 3, and any single minute could see 0, 1, 5, or more. The probabilities the calculator returns are what let you plan for that variability instead of the single average.
Queueing systems depend directly on this variability. If a call center sizes staff to the average arrival rate, it will be understaffed during the inevitable busy minutes. Using P(X ≥ k) for a suitably large k shows the probability of a surge that overwhelms a given capacity, which is how service levels are set in practice.
In reliability, the Poisson models the count of failures over a fixed operating period. Knowing P(X ≥ 1) over a mission time tells you the chance of at least one failure, which feeds directly into redundancy and maintenance decisions. The same logic applies to insurance claims, accident counts, and defect rates.
Always pair the rate with its time or space unit. A rate is meaningless without the interval it describes, and comparing rates across different intervals is a classic source of error. State "λ = 3 per minute" rather than just "λ = 3" so the prediction is reproducible.
The Poisson model rests on three pillars: independence of events, a constant rate, and no upper bound on the count. Break any one and the probabilities become misleading. The most common break is clustering. If one event makes the next more likely, such as aftershocks following an earthquake or calls arriving in bursts, the observed variance exceeds the mean, a pattern called overdispersion. The calculator, which assumes variance equals mean, will then understate the chance of large counts precisely when it matters most.
A rate that drifts over time is the second failure. The number of website visitors per minute is not constant across a day; it peaks at busy hours and dips overnight. Treating the whole day as a single Poisson process with one λ mixes periods that should be modeled separately. The honest approach is to split the interval into segments with roughly stable rates and model each on its own, or to adopt a model that lets λ vary.
Inhibition is the opposite problem: one event temporarily prevents the next, as when a server is busy and cannot accept a new request until it finishes. That creates a deficit of events right after each one, lowering the variance below the mean, or underdispersion, which the basic Poisson again cannot represent. Queueing models that account for service time handle this correctly.
Finally, the count must be of individual events in a continuum. If you are instead tallying how many categories an item falls into, or measuring a continuous amount, the Poisson does not apply. Picking the right count model, Poisson, negative binomial, or otherwise, depends on checking these assumptions against your data before trusting any probability the calculator returns.
- What does lambda represent?
- Lambda is the average number of events expected in the interval. It is both the mean and the variance of the Poisson distribution.
- Can lambda be a decimal?
- Yes. Lambda is a rate, not a count, so 2.5 events per hour is perfectly valid and common.
- What is the difference between Poisson and binomial?
- The binomial fixes the number of trials n and the per-trial probability p. The Poisson has no fixed trial count; it models counts over a continuous interval at a constant rate.
- Why is P(X >= k) not simply 1 minus P(X = k)?
- Because P(X >= k) includes k, k+1, k+2, and so on. You must subtract the cumulative probability up to k-1, not just the single point.
- When is the Poisson a good approximation to the binomial?
- When n is large, p is small, and np stays moderate (typically n ≥ 20 and p ≤ 0.05), the binomial converges to the Poisson with lambda = np.
- What happens as lambda gets large?
- The distribution becomes nearly symmetric and bell-shaped, approaching a normal distribution with mean and variance both equal to lambda.
- Is k allowed to be zero?
- Yes. k = 0 gives the probability of observing no events at all, which equals e^(-lambda).
- Why would I use this instead of the normal distribution?
- Use Poisson for discrete counts of rare independent events. The normal distribution models continuous measurements and is only an approximation here when lambda is large.
- Can the Poisson model multiple types of events?
- Only if they are pooled into one count or modeled with separate lambda values. Mixing distinct processes in one lambda obscures their individual rates.
- Does the calculator handle very large lambda?
- Yes. It evaluates the formula with full numerical precision, so large lambda values return accurate probabilities without manual factorial overflow.
- [1]National Institute of Standards and Technology (NIST). (n.d.). Poisson Distribution. Engineering Statistics Handbook.
- [2]Wikipedia. (n.d.). Poisson Distribution.
- [3]Khan Academy. (n.d.). Poisson Distribution.
- [4]Statistics How To. (n.d.). Poisson Distribution.
- [5]Wikipedia. (n.d.). Poisson Point Process.
- [6]Wikipedia. (n.d.). Probability Distribution.
Last updated: July 20, 2026
UnByte — Independent Software Engineering
Every calculator references authoritative sources — Editorial policy