View source for Poisson distribution

{{short description|Discrete probability distribution}}
{{pp-semi-vandalism|small=yes}}
{{use dmy dates|date=October 2023}}
{{Infobox probability distribution
  | name       = Poisson distribution
  | type       = mass
  | pdf_image  = [[File:poisson pmf.svg|325px]]
  | pdf_caption = The horizontal axis is the index {{mvar|k}}, the number of occurrences. {{mvar|λ}} is the expected rate of occurrences. The vertical axis is the probability of {{mvar|k}} occurrences given {{mvar|λ}}. The function is defined only at integer values of {{mvar|k}}; the connecting lines are only guides for the eye.
  | cdf_image  = [[File:poisson cdf.svg|325px]]
  | cdf_caption = The horizontal axis is the index {{mvar|k}}, the number of occurrences. The CDF is discontinuous at the integers of {{mvar|k}} and flat everywhere else because a variable that is Poisson distributed takes on only integer values.
  | notation   = <math>\operatorname{Pois}(\lambda)</math>
  | parameters = <math>\lambda\in (0, \infty)</math>  (rate)
  | support    = <math>k \in \mathbb{N}_0</math> ([[Natural numbers]] starting from&nbsp;0)
  | pdf        = <math>\frac{\lambda^{k}e^{-\lambda}}{k!}</math>
  | cdf        = <math>\frac{\Gamma(\lfloor k+1 \rfloor, \lambda)}{\lfloor k \rfloor !},</math> or <math>e^{-\lambda} \sum_{j=0}^{\lfloor k\rfloor} \frac{\lambda^j}{j!},</math> or <math>Q(\lfloor k+1 \rfloor, \lambda)</math>
(for <math>k \ge 0,</math> where <math>\Gamma(x, y)</math> is the [[upper incomplete gamma function]], <math>\lfloor k \rfloor</math> is the [[floor function]], and <math>Q</math> is the [[regularized gamma function]])
  | mean       = <math>\lambda</math>
  | median     = <math>\approx\left\lfloor\lambda + \frac{1}{3} - \frac{1}{50 \lambda} \right\rfloor</math>
  | mode       = <math>\left\lceil \lambda \right\rceil - 1, \left\lfloor \lambda \right\rfloor</math>
  | variance   = <math>\lambda</math>
  | skewness   = <math>\frac{1}{\sqrt{\lambda}}</math>
  | kurtosis   = <math>\frac{1}{\lambda}</math>
  | entropy    = <math>\lambda\Bigl[1 - \log(\lambda)\Bigr] + e^{-\lambda}\sum_{k=0}^\infty \frac{\lambda^k\log(k!)}{k!}</math>
&emsp; or for large <math>\lambda</math> &emsp;
<math>\begin{align}\approx\frac{1}{2}\log\left( 2 \pi e \lambda \right) - \frac{1}{12 \lambda} - \frac{1}{24 \lambda^2} \\- \frac{19}{360 \lambda^3} + \mathcal{O} \left(\frac{1}{\lambda^4}\right)\end{align}</math>
  | pgf        = <math>\exp \left[\lambda \left( z - 1 \right)\right]</math>
  | mgf        = <math>\exp \left[\lambda \left( e^{t} - 1 \right)\right]</math>
  | char       = <math>\exp \left[\lambda \left( e^{it} - 1 \right)\right]</math>
  | fisher     = <math>\frac{1}{\lambda}</math>
}}

In [[probability theory]] and [[statistics]], the '''Poisson distribution''' ({{IPAc-en|ˈ|p|w|ɑː|s|ɒ|n}}) is a [[discrete probability distribution]] that expresses the probability of a given number of [[event (probability theory)|events]] occurring in a fixed interval of time if these events occur with a known constant mean rate and [[Statistical independence|independently]] of the time since the last event.{{r|Haight1967}} It can also be used for the number of events in other types of intervals than time, and in dimension greater than 1 (e.g., number of events in a given area or volume).

The Poisson distribution is named after [[France|French]] mathematician [[Siméon Denis Poisson]]. It plays an important role for [[discrete-stable distribution]]s.

Under a Poisson distribution with the [[expected value|expectation]] of ''λ'' events in a given interval, the probability of ''k'' events in the same interval is:{{r|Yates2014|p=60}}
:<math>\frac{\lambda^k e^{-\lambda}}{k!} .</math>
For instance, consider a call center which receives an average of ''λ ='' 3 calls per minute at all times of day. If the calls are independent, receiving one does not change the probability of when the next one will arrive. Under these assumptions, the number ''k'' of calls received during any minute has a Poisson probability distribution. Receiving  ''k ='' 1 to 4 calls then has a probability of about 0.77, while receiving 0 or at least 5 calls has a probability of about 0.23.

A classic example used to motivate the Poisson distribution is the number of [[radioactive decay]] events during a fixed observation period.<ref>{{cite book |last=Ross |first=Sheldon M. |title=Introduction to Probability Models |publisher=Academic Press |edition=11th |year=2014}}</ref>

== History ==
The distribution was first introduced by [[Siméon Denis Poisson]] (1781–1840) and published together with his probability theory in his work ''Recherches sur la probabilité des jugements en matière criminelle et en matière civile'' (1837).{{r|Poisson1837|p=205-207}} The work theorized about the number of wrongful convictions in a given country by focusing on certain [[random variable]]s {{mvar|N}} that count, among other things, the number of discrete occurrences (sometimes called "events" or "arrivals") that take place during a [[time]]-interval of given length. The result had already been given in 1711 by [[Abraham de Moivre]] in ''De Mensura Sortis seu; de Probabilitate Eventuum in Ludis a Casu Fortuito Pendentibus'' .{{r|deMoivre1711|p=219}}{{r|deMoivre1718|p=14-15}}{{r|deMoivre1721|p=193}}{{r|Johnson2005|p=157}} This makes it an example of [[Stigler's law]] and it has prompted some authors to argue that the Poisson distribution should bear the name of de Moivre.{{r|Stigler1982|Hald1984}}

In 1860, [[Simon Newcomb]] fitted the Poisson distribution to the number of stars found in a unit of space.{{r|Newcomb1860}}
A further practical application was made by [[Ladislaus Bortkiewicz]] in 1898. Bortkiewicz showed that the frequency with which soldiers in the Prussian army were accidentally killed by horse kicks could be well modeled by a Poisson distribution.{{r|vonBortkiewitsch1898|p=23-25}}.

== Definitions ==

===Probability mass function===

A discrete [[random variable]] {{mvar|X}} is said to have a Poisson distribution with parameter <math>\lambda>0</math> if it has a [[probability mass function]] given by:{{r|Yates2014|p=60}}
:<math>f(k; \lambda) = \Pr(X{=}k)= \frac{\lambda^k e^{-\lambda}}{k!},</math>
where
* {{mvar|k}} is the number of occurrences (<math>k = 0, 1, 2, \ldots</math>)
* {{mvar|e}} is [[e (mathematical constant)|Euler's number]] (<math>e = 2.71828\ldots</math>)
* ''k''! = ''k''(''k–''1) ··· (3)(2)(1) is the [[factorial]].

The positive [[real number]] {{mvar|λ}} is equal to the [[expected value]] of {{mvar|X}} and also to its [[variance]].<ref>For the proof, see:
[[proofwiki:Expectation of Poisson Distribution|Proof wiki: expectation]] and [[proofwiki:Variance of Poisson Distribution|Proof wiki: variance]]</ref>
:<math>\lambda = \operatorname{E}(X) = \operatorname{Var}(X).</math>

The Poisson distribution can be applied to systems with a [[large number of rare events|large number of possible events, each of which is rare]]. The number of such events that occur during a fixed time interval is, under the right circumstances, a random number with a Poisson distribution.

The equation can be adapted if, instead of the average number of events <math>\lambda,</math> we are given the average rate <math>r</math> at which events occur. Then <math>\lambda = r t,</math> and:<ref>{{cite book |first=Mehran |last=Kardar |author-link=Mehran Kardar |title=Statistical Physics of Particles |title-link=Statistical Physics of Particles |publisher=[[Cambridge University Press]] |year=2007 |isbn=978-0-521-87342-0 |oclc=860391091 |page=42}}</ref>

: <math>P(k \text{ events in interval } t) = \frac{(rt)^k e^{-rt}}{k!}.</math>

===Examples===
[[File:Chewing gum on a sidewalk in Reykjavík.JPG|thumb|alt=Chewing gum on a sidewalk in Reykjavík.|Chewing gum on a sidewalk. The number of pieces on a single tile is approximately Poisson distributed.]]

The Poisson distribution may be useful to model events such as:
* the number of meteorites greater than 1-meter diameter that strike Earth in a year;
* the number of laser photons hitting a detector in a particular time interval;
* the number of students achieving a low and high mark in an exam; and
* locations of defects and dislocations in materials.

Examples of the occurrence of random points in space are: the locations of asteroid impacts with earth (2-dimensional), the locations of imperfections in a material (3-dimensional), and the locations of trees in a forest (2-dimensional).<ref>{{cite book |last1=Dekking |first1=Frederik Michel |last2=Kraaikamp |first2=Cornelis |last3=Lopuhaä |first3=Hendrik Paul |last4=Meester |first4=Ludolf Erwin |title=A Modern Introduction to Probability and Statistics |series=Springer Texts in Statistics |date=2005 |page=167 |doi=10.1007/1-84628-168-7 |isbn=978-1-85233-896-1 |url=https://doi.org/10.1007/1-84628-168-7 |language=en}}</ref>

===Assumptions and validity===
The Poisson distribution is an appropriate model if the following assumptions are true:
* {{mvar|k}}, a nonnegative integer, is the number of times an event occurs in an interval.
* The occurrence of one event [[Independence (probability theory)|does not affect the probability]] of a second event.
* The average rate at which events occur is independent of any occurrences.
* Two events cannot occur at exactly the same instant.

If these conditions are true, then {{mvar|k}} is a Poisson random variable; the distribution of {{mvar|k}} is a Poisson distribution.

The Poisson distribution is also the [[Limit (mathematics)|limit]] of a [[binomial distribution]], for which the probability of success for each trial equals {{mvar|λ}} divided by the number of trials, as the number of trials approaches infinity (see [[#Related distributions|Related distributions]]).

==== Examples of probability for Poisson distributions ====

{{col-begin|gap=5em}}
{{col-break}}
On a particular river, overflow floods occur once every 100&nbsp;years on average. Calculate the probability of {{mvar|k}} = 0, 1, 2, 3, 4, 5, or 6 overflow floods in a 100-year interval, assuming the Poisson model is appropriate.

Because the average event rate is one overflow flood per 100&nbsp;years, {{mvar|λ}} = 1

: <math> P(k \text{ overflow floods in 100 years}) = \frac{\lambda^k e^{-\lambda}}{k!} = \frac{1^k e^{-1}}{k!}</math>
: <math> P(k = 0 \text{ overflow floods in 100 years}) = \frac{1^0 e^{-1}}{0!} = \frac{e^{-1}}{1} \approx 0.368 </math>
: <math> P(k = 1 \text{ overflow flood in 100 years}) = \frac{1^1 e^{-1}}{1!} = \frac{e^{-1}}{1} \approx 0.368 </math>
: <math> P(k = 2 \text{ overflow floods in 100 years}) = \frac{1^2 e^{-1}}{2!} = \frac{e^{-1}}{2} \approx 0.184 </math>

{{col-break|gap=5em}}
:{| class="wikitable"
|-
! {{mvar|k}} !! {{mvar|P}}({{mvar|k}} overflow floods in 100&nbsp;years)
|-
| 0|| 0.368
|-
| 1|| 0.368
|-
| 2|| 0.184
|-
| 3|| 0.061
|-
| 4|| 0.015
|-
| 5|| 0.003
|-
| 6|| 0.0005
|}
The probability for 0 to 6 overflow floods in a 100-year period.
{{col-end}}

{{col-begin|gap=5em}}
{{col-break}}
It has been reported that the average number of goals in a World Cup soccer match is approximately 2.5 and the Poisson model is appropriate.{{r|Ugarte2016}}
Because the average event rate is 2.5&nbsp;goals per match, {{mvar|λ}} = 2.5&nbsp;.

: <math> P(k \text{ goals in a match}) = \frac{2.5^k e^{-2.5}}{k!}</math>
: <math> P(k = 0 \text{ goals in a match}) = \frac{2.5^0 e^{-2.5}}{0!} = \frac{e^{-2.5}}{1} \approx 0.082 </math>
: <math> P(k = 1 \text{ goal in a match}) = \frac{2.5^1 e^{-2.5}}{1!} = \frac{2.5 e^{-2.5}}{1} \approx 0.205 </math>
: <math> P(k = 2 \text{ goals in a match}) = \frac{2.5^2 e^{-2.5}}{2!} = \frac{6.25 e^{-2.5}}{2} \approx 0.257 </math>

{{col-break}}
:{| class="wikitable"
|-
! {{mvar|k}} !! {{mvar|P}}({{mvar|k}} goals in a World Cup soccer match)
|-
| 0|| 0.082
|-
| 1|| 0.205
|-
| 2|| 0.257
|-
| 3|| 0.213
|-
| 4|| 0.133
|-
| 5|| 0.067
|-
| 6|| 0.028
|-
| 7|| 0.010
|}
The probability for 0 to 7 goals in a match.
{{col-end}}

====Once in an interval events: The special case of {{mvar|λ}} = 1 and {{mvar|k}} = 0 ====

Suppose that astronomers estimate that large meteorites (above a certain size) hit the earth on average once every 100&nbsp;years ({{nobr| {{mvar|λ}} {{=}} 1 }} event per 100&nbsp;years), and that the number of meteorite hits follows a Poisson distribution. What is the probability of {{nobr| {{mvar|k}} {{=}} 0 }} meteorite hits in the next 100&nbsp;years?

: <math> P(k = \text{0 meteorites hit in next 100 years}) = \frac{1^0 e^{-1}}{0!} = \frac{1}{e} \approx 0.37.</math>

Under these assumptions, the probability that no large meteorites hit the earth in the next 100&nbsp;years is roughly 0.37. The remaining {{nobr|1 − 0.37 {{=}} 0.63}} is the probability of 1, 2, 3, or more large meteorite hits in the next 100&nbsp;years.
In an example above, an overflow flood occurred once every 100&nbsp;years {{nobr|({{mvar|λ}} {{=}} 1).}} The probability of no overflow floods in 100&nbsp;years was roughly 0.37, by the same calculation.

In general, if an event occurs on average once per interval ({{mvar|λ}}&nbsp;=&nbsp;1), and the events follow a Poisson distribution, then {{nobr|{{mvar|P}}(0 events in next interval) {{=}} 0.37.}} In addition, {{nobr|{{mvar|P}}(exactly one event in next interval) {{=}} 0.37,}} as shown in the table for overflow floods.

=== Examples that violate the Poisson assumptions ===

The number of students who arrive at the [[Student center|student union]] per minute will likely not follow a Poisson distribution, because the rate is not constant (low rate during class time, high rate between class times) and the arrivals of individual students are not independent (students tend to come in groups). The non-constant arrival rate may be modeled as a [[mixed Poisson distribution]], and the arrival of groups rather than individual students as a [[compound Poisson process]].

The number of magnitude&nbsp;5 earthquakes per year in a country may not follow a Poisson distribution, if one large earthquake increases the probability of aftershocks of similar magnitude.

Examples in which at least one event is guaranteed are not Poisson distributed; but may be modeled using a [[zero-truncated Poisson distribution]].

Count distributions in which the number of intervals with zero events is higher than predicted by a Poisson model may be modeled using a [[zero-inflated model]].

== Properties ==

=== Descriptive statistics ===
* The [[expected value]] of a Poisson random variable is {{mvar|λ}}.
* The [[variance]] of a Poisson random variable is also {{mvar|λ}}.
* The [[coefficient of variation]] is <math display="inline"> \lambda^{-1/2},</math> while the [[index of dispersion]] is 1.{{r|Johnson2005|p=163}}
* The [[mean absolute deviation]] about the mean is{{r|Johnson2005|p=163}} <math display="block">\operatorname{E}[\ |X-\lambda|\ ]= \frac{2 \lambda^{\lfloor\lambda\rfloor + 1} e^{-\lambda}}{\lfloor\lambda\rfloor!}.</math>
* The [[mode (statistics)|mode]] of a Poisson-distributed random variable with non-integer {{mvar|λ}} is equal to <math>\lfloor \lambda \rfloor,</math> which is the largest integer less than or equal to&nbsp;{{mvar|λ}}. This is also written as [[floor function|floor]]({{mvar|λ}}). When {{mvar|λ}} is a positive integer, the modes are {{mvar|λ}} and {{mvar|λ}}&nbsp;−&nbsp;1.
* All of the [[cumulant]]s of the Poisson distribution are equal to the expected value&nbsp;{{mvar|λ}}. The {{mvar|n}}&nbsp;th [[factorial moment]] of the Poisson distribution is {{mvar|λ}}{{sup| {{mvar|n}} }}&nbsp;.
* The [[expected value]] of a [[Poisson process]] is sometimes decomposed into the product of ''intensity'' and ''exposure'' (or more generally expressed as the integral of an "intensity function" over time or space, sometimes described as "exposure").{{r|Helske2017}}

=== Median ===

Bounds for the median (<math>\nu</math>) of the distribution are known and are [[Mathematical jargon#sharp|sharp]]:{{r|Choi1994}}
<math display="block">\lambda - \ln 2 \le \nu < \lambda + \frac{1}{3}.</math>

=== Higher moments ===
The higher non-centered [[moment (mathematics)|moments]] {{mvar|m}}<sub>{{mvar|k}}</sub> of the Poisson distribution are [[Touchard polynomials]] in {{mvar|λ}}: <math display="block"> m_k = \sum_{i=0}^k \lambda^i \begin{Bmatrix} k \\ i \end{Bmatrix},</math> where the braces { } denote [[Stirling numbers of the second kind]].{{r|Riordan1937}}{{r|Haight1967|p=6}} In other words,<math display="block">E[X] = \lambda, \quad E[X(X-1)] = \lambda^2, \quad E[X(X-1)(X-2)] = \lambda^3, \cdots</math>When the expected value is set to ''λ ='' 1, [[Dobinski's formula]] implies that the {{mvar|n}}‑th moment is equal to the number of [[partition of a set|partitions of a set]] of size {{mvar|n}}.

A simple upper bound is:<ref>{{cite journal |last1=D. Ahle |first1=Thomas | year=2022 |title=Sharp and simple bounds for the raw moments of the Binomial and Poisson distributions | journal=Statistics & Probability Letters | volume=182 |page=109306 | doi=10.1016/j.spl.2021.109306 |arxiv=2103.17027 }}</ref>
<math display="block">m_k = E[X^k] \le
\left(\frac{k}{\log(k/\lambda+1)}\right)^k \le \lambda^k \exp\left(\frac{k^2}{2\lambda}\right).</math>

=== Sums of Poisson-distributed random variables ===
If <math>X_i \sim \operatorname{Pois}(\lambda_i)</math> for <math>i=1,\dotsc,n</math> are [[statistical independence|independent]], then <math display="inline">\sum_{i=1}^n X_i \sim \operatorname{Pois}\left(\sum_{i=1}^n \lambda_i\right).</math>{{r|Lehmann1986|p=65}} A converse is [[Raikov's theorem]], which says that if the sum of two independent random variables is Poisson-distributed, then so are each of those two independent random variables.{{r|Raikov1937}}{{r|vonMises1964|p=}}

=== Maximum entropy ===
It is a [[Maximum entropy probability distribution|maximum-entropy distribution]] among the set of generalized binomial distributions <math>B_n(\lambda)</math> with mean <math>\lambda</math> and <math>n\rightarrow\infty</math>,<ref>{{cite journal |last=Harremoes |first=P. |date=July 2001 |title=Binomial and Poisson distributions as maximum entropy distributions |journal=IEEE Transactions on Information Theory |volume=47 |issue=5 |pages=2039–2041 |doi=10.1109/18.930936|s2cid=16171405 }}</ref> where a generalized binomial distribution is defined as a distribution of the sum of N independent but not identically distributed Bernoulli variables.

=== Other properties ===
* The Poisson distributions are [[Infinite divisibility (probability)|infinitely divisible]] probability distributions.{{r|Laha1979|p=233}}{{r|Johnson2005|p=164}}
* The directed [[Kullback–Leibler divergence]] of <math>P=\operatorname{Pois}(\lambda)</math> from <math>P_0=\operatorname{Pois}(\lambda_0)</math> is given by <math display="block">\operatorname{D}_{\text{KL}}(P\parallel P_0) = \lambda_0 - \lambda + \lambda \log \frac{\lambda}{\lambda_0}.</math>
* If <math>\lambda \geq 1</math> is an integer, then <math>Y\sim \operatorname{Pois}(\lambda)</math> satisfies <math>\Pr(Y \geq E[Y]) \geq \frac{1}{2}</math> and <math>\Pr(Y \leq E[Y]) \geq \frac{1}{2}.</math><ref>{{cite book |last=Mitzenmacher |first=Michael |date=2017 |others=Eli Upfal |title=Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis |isbn=978-1-107-15488-9 |edition=2nd |location=Cambridge, UK |at=Exercise&nbsp;5.14 |oclc=960841613}}</ref>{{Failed verification|date=January 2024|talk=Other Properties - Mitzenmacher}}
* Bounds for the tail probabilities of a Poisson random variable <math> X \sim \operatorname{Pois}(\lambda)</math> can be derived using a [[Chernoff bound]] argument.{{r|Mitzenmacher2005|p=97-98}} <math display="block">P(X \geq x) \leq \frac{(e \lambda)^x e^{-\lambda}}{x^x}, \text{ for } x > \lambda,</math> <math display="block">P(X \leq x) \leq \frac{(e \lambda)^x e^{-\lambda} }{x^x}, \text{ for } x < \lambda.</math>
* The upper tail probability can be tightened (by a factor of at least two) as follows:<ref>{{cite journal|last1=Short |first1=Michael|year=2013|title=Improved Inequalities for the Poisson and Binomial Distribution and Upper Tail Quantile Functions|journal=ISRN Probability and Statistics|volume=2013|at=Corollary 6|doi=10.1155/2013/412958 |doi-access=free}}</ref>
<math display="block">P(X \geq x) \leq \frac{e^{-\operatorname{D}_{\text{KL}}(Q\parallel P)}}{\max{(2, \sqrt{4\pi\operatorname{D}_{\text{KL}}(Q\parallel P)}})}, \text{ for } x > \lambda,</math> where <math>\operatorname{D}_{\text{KL}}(Q\parallel P)</math> is the Kullback–Leibler divergence of <math>Q=\operatorname{Pois}(x)</math> from <math>P=\operatorname{Pois}(\lambda)</math>.
* Inequalities that relate the distribution function of a Poisson random variable <math> X \sim \operatorname{Pois}(\lambda)</math> to the [[Standard normal distribution]] function <math> \Phi(x) </math> are as follows:<ref>{{cite journal|last1=Short |first1=Michael|year=2013|title=Improved Inequalities for the Poisson and Binomial Distribution and Upper Tail Quantile Functions|journal=ISRN Probability and Statistics|volume=2013 |at=Theorem 2|doi=10.1155/2013/412958 |doi-access=free}}</ref> <math display="block"> \Phi\left(\operatorname{sign}(k-\lambda)\sqrt{2\operatorname{D}_{\text{KL}}(Q_-\parallel P)}\right) < P(X \leq k) < \Phi\left(\operatorname{sign}(k+1-\lambda)\sqrt{2\operatorname{D}_{\text{KL}}(Q_+\parallel P)}\right), \text{ for } k > 0,</math> where <math>\operatorname{D}_{\text{KL}}(Q_-\parallel P)</math> is the Kullback–Leibler divergence of <math>Q_-=\operatorname{Pois}(k)</math> from <math>P=\operatorname{Pois}(\lambda)</math> and <math>\operatorname{D}_{\text{KL}}(Q_+\parallel P)</math> is the Kullback–Leibler divergence of <math>Q_+=\operatorname{Pois}(k+1)</math> from <math>P</math>.

=== Poisson races ===

Let <math>X \sim \operatorname{Pois}(\lambda)</math> and <math>Y \sim \operatorname{Pois}(\mu)</math> be independent random variables, with <math> \lambda < \mu,</math> then we have that
<math display="block">
 \frac{e^{-(\sqrt{\mu} -\sqrt{\lambda})^2  }}{(\lambda + \mu)^2} - \frac{e^{-(\lambda + \mu)}}{2\sqrt{\lambda \mu}} - \frac{e^{-(\lambda + \mu)}}{4\lambda \mu} \leq P(X - Y \geq 0) \leq e^{- (\sqrt{\mu} -\sqrt{\lambda})^2}
</math>

The upper bound is proved using a standard Chernoff bound.

The lower bound can be proved by noting that <math> P(X-Y\geq0\mid X+Y=i)</math> is the probability that <math display="inline">Z \geq \frac{i}{2},</math> where <math display="inline">Z \sim \operatorname{Bin}\left(i, \frac{\lambda}{\lambda+\mu}\right),</math> which is bounded below by <math display="inline"> \frac{1}{(i+1)^2} e^{-iD\left(0.5 \| \frac{\lambda}{\lambda+\mu}\right)},</math> where <math>D</math> is [[Kullback–Leibler divergence|relative entropy]] (See the entry on [[Binomial distribution#Tail bounds|bounds on tails of binomial distributions]] for details). Further noting that <math> X+Y \sim \operatorname{Pois}(\lambda+\mu),</math> and computing a lower bound on the unconditional probability gives the result. More details can be found in the appendix of Kamath et al.{{r|Kamath2015}}

== Related distributions ==
=== As a Binomial distribution with infinitesimal time-steps ===
The Poisson distribution can be derived as a limiting case to the [[binomial distribution]] as the number of trials goes to infinity and the [[expected value|expected]] number of successes remains fixed — see [[#law of rare events|law of rare events]] below. Therefore, it can be used as an approximation of the binomial distribution if {{mvar|n}} is sufficiently large and ''p'' is sufficiently small. The Poisson distribution is a good approximation of the binomial distribution if {{mvar|n}} is at least 20 and ''p'' is smaller than or equal to 0.05, and an excellent approximation if {{mvar|n}}&nbsp;≥&nbsp;100 and {{mvar|n p}}&nbsp;≤&nbsp;10.{{r|NIST2006}} Letting <math>F_{\mathrm B}</math> and <math>F_{\mathrm P}</math> be the respective [[Cumulative distribution function|cumulative density functions]] of the binomial and Poisson distributions, one has: <math display="block">F_\mathrm{B}(k;n, p) \ \approx\  F_\mathrm{P}(k;\lambda=np). </math>One derivation of this uses [[probability-generating function]]s.<ref>{{Cite book |last=Feller |first=William |title=An Introduction to Probability Theory and its Applications}}</ref> Consider a [[Bernoulli trial]] (coin-flip) whose probability of one success (or expected number of successes) is <math>\lambda \leq 1 </math> within a given interval. Split the interval into ''n'' parts, and perform a trial in each subinterval with probability <math>\tfrac{ \lambda }{n}  </math>. The probability of ''k'' successes out of ''n'' trials over the entire interval is then given by the binomial distribution<blockquote><math>p_k^{(n)}=\binom nk \left(\frac{\lambda}{n}\right)^{\!k} \left(1{-}\frac{\lambda}{n}\right)^{\! n-k},  </math> </blockquote>whose generating function is:<blockquote><math>P^{(n)}(x)=\sum_{k=0}^n p_k^{(n)} x^k = \left(1-\frac{\lambda}{n} +\frac{\lambda}{n} x \right)^n.  </math></blockquote>Taking the limit as ''n'' increases to infinity (with ''x'' fixed) and applying the product limit definition of the [[exponential function]], this reduces to the generating function of the Poisson distribution:<blockquote><math>\lim_{n\to\infty} P^{(n)}(x)=\lim_{n\to\infty} \left(1{+}\tfrac{\lambda(x-1)}{n}\right)^n
= e^{\lambda(x-1)} = \sum_{k= 0}^\infty e^{-\lambda}\frac{\lambda^k }{k!} x^k.   </math></blockquote>

===General===
* If <math>X_1 \sim \mathrm{Pois}(\lambda_1)\,</math> and <math>X_2 \sim \mathrm{Pois}(\lambda_2)\,</math> are independent, then the difference <math> Y = X_1 - X_2</math> follows a [[Skellam distribution]].
* If <math>X_1 \sim \mathrm{Pois}(\lambda_1)\,</math> and <math>X_2 \sim \mathrm{Pois}(\lambda_2)\,</math> are independent, then the distribution of <math>X_1</math> conditional on <math>X_1+X_2</math> is a [[binomial distribution]]. {{pb}} Specifically, if <math>X_1+X_2=k,</math> then <math>X_1| X_1+X_2=k\sim \mathrm{Binom}(k, \lambda_1/(\lambda_1+\lambda_2)).</math> {{pb}} More generally, if ''X''<sub>1</sub>, ''X''<sub>2</sub>, ..., ''X''<sub>{{mvar|n}}</sub> are independent Poisson random variables with parameters {{mvar|λ}}<sub>1</sub>, {{mvar|λ}}<sub>2</sub>, ..., {{mvar|λ}}<sub>{{mvar|n}}</sub> then
*: given <math>\sum_{j=1}^n X_j=k,</math> it follows that <math>X_i\Big|\sum_{j=1}^n X_j=k \sim \mathrm{Binom}\left(k, \frac{\lambda_i}{\sum_{j=1}^n \lambda_j}\right).</math> In fact, <math>\{X_i\} \sim \mathrm{Multinom}\left(k, \left\{\frac{\lambda_i}{\sum_{j=1}^n\lambda_j}\right\}\right).</math>
* If <math>X \sim \mathrm{Pois}(\lambda)\,</math> and the distribution of <math>Y</math> conditional on ''X''&nbsp;=&nbsp;{{mvar|k}} is a [[binomial distribution]], <math>Y \mid (X = k) \sim \mathrm{Binom}(k, p),</math> then the distribution of Y follows a Poisson distribution <math>Y \sim \mathrm{Pois}(\lambda \cdot p).</math> In fact, if, conditional on <math>\{X = k\},</math> <math>\{Y_i\}</math> follows a [[multinomial distribution]], <math>\{Y_i\} \mid (X = k) \sim \mathrm{Multinom}\left(k, p_i\right),</math> then each <math>Y_i</math> follows an independent Poisson distribution <math>Y_i \sim \mathrm{Pois}(\lambda \cdot p_i), \rho(Y_i, Y_j) = 0.</math>
* The Poisson distribution is a [[special case]] of the discrete compound Poisson distribution (or stuttering Poisson distribution) with only a parameter.{{r|Zhang2013|Zhang2016}} The discrete compound Poisson distribution can be deduced from the limiting distribution of univariate multinomial distribution. It is also a [[compound Poisson distribution#Special cases|special case]] of a [[compound Poisson distribution]].
* For sufficiently large values of {{mvar|λ}}, (say {{mvar|λ}}>1000), the [[normal distribution]] with mean {{mvar|λ}} and variance {{mvar|λ}} (standard deviation <math>\sqrt{\lambda}</math>) is an excellent approximation to the Poisson distribution. If {{mvar|λ}} is greater than about 10, then the normal distribution is a good approximation if an appropriate [[continuity correction]] is performed, i.e., if {{math|P(''X'' ≤ ''x'')}}, where ''x'' is a non-negative integer, is replaced by {{math|P(''X'' ≤ ''x'' + 0.5)}}. <math display="block">F_\mathrm{Poisson}(x;\lambda) \approx F_\mathrm{normal}(x;\mu=\lambda,\sigma^2=\lambda)</math>
* [[Variance-stabilizing transformation]]: If <math>X \sim \mathrm{Pois}(\lambda),</math> then{{r|Johnson2005|p=168}} <math display="block">Y = 2 \sqrt{X} \approx \mathcal{N}(2\sqrt{\lambda};1),</math> and{{r|McCullagh1989|p=196}} <math display="block">Y = \sqrt{X} \approx \mathcal{N}(\sqrt{\lambda};1/4).</math> Under this transformation, the convergence to normality (as <math>\lambda</math> increases) is far faster than the untransformed variable.{{Citation needed|date=May 2012}} Other, slightly more complicated, variance stabilizing transformations are available,{{r|Johnson2005|p=168}} one of which is [[Anscombe transform]].{{r|Anscombe1948}} See [[Data transformation (statistics)]] for more general uses of transformations.
* If for every ''t''&nbsp;>&nbsp;0 the number of arrivals in the time interval {{closed-closed|0, ''t''}} follows the Poisson distribution with mean ''λt'', then the sequence of inter-arrival times are independent and identically distributed [[exponential distribution|exponential]] random variables having mean&nbsp;1/{{mvar|λ}}.{{r|Ross2010|p=317–319}}
* The [[cumulative distribution function]]s of the Poisson and [[chi-squared distribution]]s are related in the following ways:{{r|Johnson2005|p=167}} <math display="block">F_\text{Poisson}(k;\lambda) = 1-F_{\chi^2}(2\lambda;2(k+1)) \quad\quad \text{ integer } k,</math> and{{r|Johnson2005|p=158}} <math display="block">P(X=k)=F_{\chi^2}(2\lambda;2(k+1)) -F_{\chi^2}(2\lambda;2k).</math>

=== Poisson approximation ===

Assume <math>X_1\sim\operatorname{Pois}(\lambda_1), X_2\sim\operatorname{Pois}(\lambda_2), \dots, X_n\sim\operatorname{Pois}(\lambda_n)</math> where <math>\lambda_1 + \lambda_2 + \dots + \lambda_n=1,</math> then<ref>{{Cite web | url=https://newonlinecourses.science.psu.edu/stat504/node/48/ | title=1.7.7 – Relationship between the Multinomial and Poisson &#124; STAT 504 | access-date=6 August 2019 | archive-date=6 August 2019 | archive-url=https://web.archive.org/web/20190806195228/https://newonlinecourses.science.psu.edu/stat504/node/48/ | url-status=dead }}</ref> <math>(X_1, X_2, \dots, X_n)</math> is [[Multinomial distribution|multinomially distributed]]
<math>(X_1, X_2, \dots, X_n) \sim \operatorname{Mult}(N, \lambda_1, \lambda_2, \dots, \lambda_n)</math> conditioned on <math>N = X_1 + X_2 + \dots X_n.</math>

This means{{r|Mitzenmacher2005|p=101-102}}, among other things, that for any nonnegative function <math>f(x_1, x_2, \dots, x_n),</math>
if <math>(Y_1, Y_2, \dots, Y_n)\sim\operatorname{Mult}(m, \mathbf{p})</math> is multinomially distributed, then
<math display="block">
\operatorname{E}[f(Y_1, Y_2, \dots, Y_n)] \le e\sqrt{m}\operatorname{E}[f(X_1, X_2, \dots, X_n)]
</math>
where <math>(X_1, X_2, \dots, X_n)\sim\operatorname{Pois}(\mathbf{p}).</math>

The factor of <math>e\sqrt{m}</math> can be replaced by 2 if <math>f</math> is further assumed to be monotonically increasing or decreasing.

=== Bivariate Poisson distribution ===
This distribution has been extended to the [[Joint probability distribution|bivariate]] case.{{r|Loukas1986}} The [[generating function]] for this distribution is
<math display="block"> g( u, v ) = \exp[ ( \theta_1 - \theta_{12} )( u - 1 ) + ( \theta_2 - \theta_{12} )(v - 1) + \theta_{12} ( uv - 1 ) ] </math>

with <math display="block"> \theta_1, \theta_2 > \theta_{ 12 } > 0 </math>

The marginal distributions are Poisson(''θ''<sub>1</sub>) and Poisson(''θ''<sub>2</sub>) and the correlation coefficient is limited to the range
<math display="block"> 0 \le \rho \le \min\left\{ \sqrt{ \frac{ \theta_1 }{ \theta_2 } }, \sqrt{ \frac{ \theta_2 }{ \theta_1 } } \right\}</math>

A simple way to generate a bivariate Poisson distribution <math>X_1,X_2</math> is to take three independent Poisson distributions <math>Y_1,Y_2,Y_3</math> with means <math>\lambda_1,\lambda_2,\lambda_3</math> and then set <math>X_1 = Y_1 + Y_3, X_2 = Y_2 + Y_3.</math> The probability function of the bivariate Poisson distribution is
<math display="block">
\Pr(X_1=k_1,X_2=k_2) = 
\exp\left(-\lambda_1-\lambda_2-\lambda_3\right) \frac{\lambda_1^{k_1}}{k_1!} \frac{\lambda_2^{k_2}}{k_2!} \sum_{k=0}^{\min(k_1,k_2)} \binom{k_1}{k} \binom{k_2}{k} k! \left( \frac{\lambda_3}{\lambda_1\lambda_2}\right)^k
</math>

===Free Poisson distribution===
The free Poisson distribution<ref>Free Random Variables by D. Voiculescu, K. Dykema, A. Nica, CRM Monograph Series, American Mathematical Society, Providence RI, 1992</ref> with jump size <math>\alpha</math> and rate <math>\lambda</math> arises in [[free probability]] theory as the limit of repeated [[free convolution]]
<math display="block">\left( \left(1-\frac{\lambda}{N}\right)\delta_0 + \frac{\lambda}{N}\delta_\alpha\right)^{\boxplus N}</math>
as {{math|''N'' → ∞}}.

In other words, let <math>X_N</math> be random variables so that <math>X_N</math> has value <math>\alpha</math> with probability <math display="inline">\frac{\lambda}{N}</math> and value 0 with the remaining probability. Assume also that the family <math>X_1, X_2, \ldots</math> are [[free independence|freely independent]]. Then the limit as <math>N \to \infty</math> of the law of <math>X_1 + \cdots +X_N</math> is given by the Free Poisson law with parameters <math>\lambda,\alpha.</math>

This definition is analogous to one of the ways in which the classical Poisson distribution is obtained from a (classical) Poisson process.

The measure associated to the free Poisson law is given by<ref>Alexandru Nica, Roland Speicher: [https://rolandspeicher.com/literature/nica-speicher/ Lectures on the Combinatorics of Free Probability]. London Mathematical Society Lecture Note Series, Vol. 335, Cambridge University Press, 2006.</ref>
<math display="block">\mu=\begin{cases}
(1-\lambda) \delta_0 + \nu,& \text{if } 0\leq \lambda \leq 1 \\
\nu, & \text{if }\lambda >1,
\end{cases}</math>
where <math display="block">\nu = \frac{1}{2\pi\alpha t}\sqrt{4\lambda \alpha^2 - ( t - \alpha (1+\lambda))^2} \, dt</math> and has support <math>[\alpha (1-\sqrt{\lambda})^2,\alpha (1+\sqrt{\lambda})^2].</math>

This law also arises in [[random matrix]] theory as the [[Marchenko–Pastur law]]. Its [[Cumulant#Free cumulants|free cumulants]] are equal to <math>\kappa_n=\lambda\alpha^n.</math>

====Some transforms of this law====
We give values of some important transforms of the free Poisson law; the computation can be found in e.g. in the book ''Lectures on the Combinatorics of Free Probability'' by A. Nica and R. Speicher<ref>[http://rolandspeicher.com/literature/nica-speicher/ Lectures on the Combinatorics of Free Probability] by A. Nica and R. Speicher, pp. 203–204, Cambridge Univ. Press 2006</ref>

The R-transform of the free Poisson law is given by
<math display="block">R(z)=\frac{\lambda \alpha}{1-\alpha z}. </math>

The Cauchy transform (which is the negative of the [[Stieltjes transformation]]) is given by
<math display="block">
G(z) = \frac{ z + \alpha - \lambda \alpha - \sqrt{ (z-\alpha (1+\lambda))^2 - 4 \lambda \alpha^2}}{2\alpha z}
</math>

The S-transform is given by
<math display="block">S(z) = \frac{1}{z+\lambda}</math>
in the case that <math>\alpha = 1.</math>

===Weibull and stable count===

Poisson's probability mass function <math> f(k; \lambda)</math> can be expressed in a form similar to the product distribution of a [[Weibull distribution]] and a variant form of the [[stable count distribution]]. 
The variable <math> (k+1) </math> can be regarded as inverse of Lévy's stability parameter in the stable count distribution:
<math display="block">
    f(k; \lambda) =
        \int_0^\infty \frac{1}{u} \, W_{k+1} \left(\frac{\lambda}{u}\right) 
        \left[ (k+1) u^k \, \mathfrak{N}_{\frac{1}{k+1}} (u^{k+1}) \right] \, du ,
</math>
where <math>\mathfrak{N}_\alpha(\nu)</math> is a standard stable count distribution of shape <math> \alpha = 1/(k+1),</math> and <math>W_{k+1}(x)</math> is a standard Weibull distribution of shape <math>k+1.</math>

== Statistical inference ==
{{See also|Poisson regression}}

=== Parameter estimation ===
Given a sample of {{mvar|n}} measured values <math>k_i \in \{0,1,\dots\},</math> for {{nobr| {{math|''i'' {{=}} 1, ..., ''n''}},}} we wish to estimate the value of the parameter {{mvar|λ}} of the Poisson population from which the sample was drawn. The [[maximum likelihood]] estimate is<ref>{{cite web |last=Paszek |first=Ewa |title=Maximum likelihood estimation – examples |website=cnx.org |url = http://cnx.org/content/m13500/latest/?collection=col10343/latest}}</ref>

:<math>\widehat{\lambda}_\mathrm{MLE}=\frac{1}{n}\sum_{i=1}^n k_i\ .</math>

Since each observation has expectation {{mvar|λ}} so does the sample mean. Therefore, the maximum likelihood estimate is an [[unbiased estimator]] of {{mvar|λ}}. It is also an efficient estimator since its variance achieves the [[Cramér–Rao lower bound]] (CRLB).<ref>{{Cite book |last=Van Trees |first=Harry L. |url=https://www.worldcat.org/oclc/851161356 |title=Detection estimation and modulation theory.|date=2013|others=Kristine L. Bell, Zhi Tian |isbn=978-1-299-66515-6|edition=Second |location=Hoboken, N.J. |oclc=851161356}}</ref> Hence it is [[Minimum-variance unbiased estimator|minimum-variance unbiased]]. Also it can be proven that the sum (and hence the sample mean as it is a one-to-one function of the sum) is a complete and sufficient statistic for {{mvar|λ}}.

To prove sufficiency we may use the [[Sufficient statistic|factorization theorem]]. Consider partitioning the probability mass function of the joint Poisson distribution for the sample into two parts: one that depends solely on the sample <math>\mathbf{x}</math>, called <math>h(\mathbf{x})</math>, and one that depends on the parameter <math>\lambda</math> and the sample <math>\mathbf{x}</math> only through the function <math>T(\mathbf{x}).</math> Then <math>T(\mathbf{x})</math> is a sufficient statistic for <math>\lambda.</math>

: <math> P(\mathbf{x})=\prod_{i=1}^n\frac{\lambda^{x_i} e^{-\lambda}}{x_i!}=\frac{1}{\prod_{i=1}^n x_i!} \times \lambda^{\sum_{i=1}^n x_i}e^{-n\lambda} </math>

The first term <math>h(\mathbf{x})</math> depends only on <math>\mathbf{x}</math>. The second term <math>g(T(\mathbf{x})|\lambda)</math> depends on the sample only through <math display="inline">T(\mathbf{x})=\sum_{i=1}^n x_i.</math> Thus, <math>T(\mathbf{x})</math> is sufficient.

To find the parameter {{mvar|λ}} that maximizes the probability function for the Poisson population, we can use the logarithm of the likelihood function:

: <math> \begin{align}
\ell(\lambda) & = \ln \prod_{i=1}^n f(k_i \mid \lambda) \\
& = \sum_{i=1}^n \ln\!\left(\frac{e^{-\lambda}\lambda^{k_i}}{k_i!}\right) \\
& = -n\lambda + \left(\sum_{i=1}^n k_i\right) \ln(\lambda) - \sum_{i=1}^n \ln(k_i!).
\end{align} </math>

We take the derivative of <math>\ell</math> with respect to {{mvar|λ}} and compare it to zero:

: <math>\frac{\mathrm{d}}{\mathrm{d}\lambda} \ell(\lambda) = 0 \iff -n + \left(\sum_{i=1}^n k_i\right) \frac{1}{\lambda} = 0. \!</math>

Solving for {{mvar|λ}} gives a stationary point.

: <math> \lambda = \frac{\sum_{i=1}^n k_i}{n}</math>

So {{mvar|λ}} is the average of the {{mvar|k}}<sub>''i''</sub> values. Obtaining the sign of the second derivative of ''L'' at the stationary point will determine what kind of extreme value {{mvar|λ}} is.

: <math>\frac{\partial^2 \ell}{\partial \lambda^2} = -\lambda^{-2}\sum_{i=1}^n k_i </math>

Evaluating the second derivative ''at the stationary point'' gives:

: <math>\frac{\partial^2 \ell}{\partial \lambda^2} = - \frac{n^2}{\sum_{i=1}^n k_i} </math>

which is the negative of {{mvar|n}} times the reciprocal of the average of the k<sub>i</sub>. This expression is negative when the average is positive. If this is satisfied, then the stationary point maximizes the probability function.

For [[Completeness (statistics)|completeness]], a family of distributions is said to be complete if and only if <math> E(g(T)) = 0</math> implies that <math>P_\lambda(g(T) = 0) = 1</math> for all <math>\lambda.</math> If the individual <math>X_i</math> are iid <math>\mathrm{Po}(\lambda),</math> then <math display="inline">T(\mathbf{x})=\sum_{i=1}^n X_i\sim \mathrm{Po}(n\lambda).</math> Knowing the distribution we want to investigate, it is easy to see that the statistic is complete.

:<math>E(g(T))=\sum_{t=0}^\infty g(t)\frac{(n\lambda)^te^{-n\lambda}}{t!} = 0</math>

For this equality to hold, <math>g(t)</math> must be 0. This follows from the fact that none of the other terms will be 0 for all <math>t</math> in the sum and for all possible values of <math>\lambda.</math> Hence, <math>E(g(T)) = 0</math> for all <math>\lambda</math> implies that <math>P_\lambda(g(T) = 0) = 1,</math> and the statistic has been shown to be complete.

=== Confidence interval ===
The [[confidence interval]] for the mean of a Poisson distribution can be expressed using the relationship between the cumulative distribution functions of the Poisson and [[chi-squared distribution]]s. The chi-squared distribution is itself closely related to the [[gamma distribution]], and this leads to an alternative expression. Given an observation {{mvar|k}} from a Poisson distribution with mean ''μ'', a confidence interval for ''μ'' with confidence level {{math|1 – ''α''}} is

:<math>\tfrac {1}{2}\chi^{2}(\alpha/2; 2k) \le \mu \le \tfrac {1}{2} \chi^{2}(1-\alpha/2; 2k+2), </math>

or equivalently,

:<math>F^{-1}(\alpha/2; k,1) \le \mu \le F^{-1}(1-\alpha/2; k+1,1),</math>

where <math>\chi^{2}(p;n)</math> is the [[quantile function]] (corresponding to a lower tail area ''p'') of the chi-squared distribution with {{mvar|n}} degrees of freedom and <math>F^{-1}(p;n,1)</math> is the quantile function of a [[gamma distribution]] with shape parameter n and scale parameter 1.{{r|Johnson2005|p=176-178|Garwood1936}} This interval is '[[exact statistics|exact]]' in the sense that its [[coverage probability]] is never less than the nominal {{math|1 – ''α''}}.

When quantiles of the gamma distribution are not available, an accurate approximation to this exact interval has been proposed (based on the [[Wilson–Hilferty transformation]]):{{r|Breslow1987}}
:<math>k \left( 1 - \frac{1}{9k} - \frac{z_{\alpha/2}}{3\sqrt{k}}\right)^3 \le \mu \le (k+1) \left( 1 - \frac{1}{9(k+1)} + \frac{z_{\alpha/2}}{3\sqrt{k+1}}\right)^3, </math>
where <math>z_{\alpha/2}</math> denotes the [[standard normal deviate]] with upper tail area {{math|α / 2}}.

For application of these formulae in the same context as above (given a sample of {{mvar|n}} measured values {{mvar|k}}<sub>''i''</sub> each drawn from a Poisson distribution with mean {{mvar|λ}}), one would set

:<math>k=\sum_{i=1}^n k_i ,</math>
calculate an interval for {{nobr| {{mvar|μ}} {{=}} {{mvar|n λ}} ,}} and then derive the interval for {{mvar|λ}}.

=== Bayesian inference ===
In [[Bayesian inference]], the [[conjugate prior]] for the rate parameter {{mvar|λ}} of the Poisson distribution is the [[gamma distribution]].{{r|Fink1976}} Let

:<math>\lambda \sim \mathrm{Gamma}(\alpha, \beta) </math>

denote that {{mvar|λ}} is distributed according to the gamma [[probability density function|density]] ''g'' parameterized in terms of a [[shape parameter]] ''α'' and an inverse [[scale parameter]] ''β'':

:<math> g(\lambda \mid \alpha,\beta) = \frac{\beta^{\alpha}}{\Gamma(\alpha)} \; \lambda^{\alpha-1} \; e^{-\beta\,\lambda} \qquad \text{ for } \lambda>0 \,\!.</math>

Then, given the same sample of {{mvar|n}} measured values {{mvar|k}}<sub>''i''</sub> [[#Maximum likelihood|as before]], and a prior of Gamma(''α'', ''β''), the posterior distribution is

:<math>\lambda \sim \mathrm{Gamma}\left(\alpha + \sum_{i=1}^n k_i, \beta + n\right).</math>

Note that the posterior mean is linear and is given by 
:<math> E[ \lambda \mid k_1, \ldots, k_n ] = \frac{\alpha + \sum_{i=1}^n k_i}{\beta + n}.</math>
It can be shown that gamma distribution is the only prior that induces linearity of the conditional mean. Moreover, a converse result exists which states that if the conditional mean is close to a linear function in the <math>L_2</math> distance than the prior distribution of {{mvar|λ}} must be close to gamma distribution in [[Lévy metric|Levy distance]].<ref>{{cite journal |last1=Dytso |first1=Alex|last2=Poor |first2=H. Vincent |title=Estimation in Poisson noise: Properties of the conditional mean estimator|journal=IEEE Transactions on Information Theory|date=2020|volume=66|issue=7|pages=4304–4323|doi=10.1109/TIT.2020.2979978|s2cid=207853178 |doi-access=free |arxiv=1911.03744}}</ref>

The posterior mean E[{{mvar|λ}}] approaches the maximum likelihood estimate <math>\widehat{\lambda}_\mathrm{MLE}</math> in the limit as <math>\alpha\to 0, \beta \to 0,</math> which follows immediately from the general expression of the mean of the [[gamma distribution]].

The [[posterior predictive distribution]] for a single additional observation is a [[negative binomial distribution]],{{r|Gelman2003|p=53}} sometimes called a gamma–Poisson distribution.

=== Simultaneous estimation of multiple Poisson means ===
Suppose <math>X_1, X_2, \dots, X_p</math> is a set of independent random variables from a set of <math>p</math> Poisson distributions, each with a parameter <math>\lambda_i,</math> <math>i=1,\dots, p,</math> and we would like to estimate these parameters. Then, Clevenson and Zidek show that under the normalized squared error loss <math display="inline">L(\lambda,{\hat \lambda})=\sum_{i=1}^p \lambda_i^{-1} ({\hat \lambda}_i-\lambda_i)^2,</math> when <math>p>1,</math> then, similar as in [[Stein's example]] for the Normal means, the MLE estimator <math>{\hat \lambda}_i = X_i</math> is [[Admissible decision rule|inadmissible]]. {{r|Clevenson1975}}

In this case, a family of [[minimax estimator]]s is given for any <math>0 < c \leq 2(p-1)</math> and <math>b \geq (p-2+p^{-1})</math> as{{r|Berger1985}}
:<math>{\hat \lambda}_i = \left(1 - \frac{c}{b + \sum_{i=1}^p X_i}\right) X_i, \qquad i=1,\dots,p.</math>

== Occurrence and applications ==
{{More citations needed|date=December 2019}}

Some applications of the Poisson distribution to [[count data]] (number of events):{{r|Rasch1963}}
* [[telecommunication]]: telephone calls arriving in a system,
* [[astronomy]]: photons arriving at a telescope,
* [[chemistry]]: the [[molar mass distribution]] of a [[living polymerization]],{{r|Flory1940}}
* [[biology]]: the number of mutations on a strand of [[DNA]] per unit length,
* [[management]]: customers arriving at a counter or call centre,
* [[finance and insurance]]: number of losses or claims occurring in a given period of time,
* [[Earthquake seismology|seismology]]: asymptotic Poisson model of risk for large earthquakes,{{r|Lomnitz1994|p=}}
* [[radioactivity]]: decays in a given time interval in a radioactive sample,
* [[optics]]: number of photons emitted in a single laser pulse (a major vulnerability of [[quantum key distribution]] protocols, known as photon number splitting).

More examples of counting events that may be modelled as Poisson processes include:
<!--
   Surely there are enough examples in this list now! However, not enough with citations
-->
* soldiers killed by horse-kicks each year in each corps in the [[Prussia]]n cavalry. This example was used in a book by [[Ladislaus Bortkiewicz]] (1868–1931),{{r|vonBortkiewitsch1898|p=23-25}}
* yeast cells used when brewing [[Guinness]] beer. This example was used by [[William Sealy Gosset]] (1876–1937),{{r|Student1907}}{{r|Boland1984}}
* phone calls arriving at a [[call centre]] within a minute. This example was described by [[Agner Krarup Erlang|A.K. Erlang]] (1878–1929),{{r|Erlang1909}}
* goals in sports involving two competing teams,{{r|Hornby2014}}
* deaths per year in a given age group,
* jumps in a stock price in a given time interval,
* times a [[web server]] is accessed per minute (under an assumption of [[Poisson process#Homogeneous|homogeneity]]),
* [[mutation]]s in a given stretch of [[DNA]] after a certain amount of radiation,
* [[cells (biology)|cells]] infected at a given [[multiplicity of infection]],
* bacteria in a certain amount of liquid,{{r|Koyama2016}}
* [[photons]] arriving on a pixel circuit at a given illumination over a given time period,
* landing of [[V-1 flying bomb]]s on London during World War II, investigated by R. D. Clarke in 1946.{{r|Clarke1946}}
In [[probabilistic number theory]], [[Patrick X. Gallagher|Gallagher]] showed in 1976 that, if a certain version of the unproved [[Second Hardy–Littlewood conjecture|prime r-tuple conjecture]] holds,{{r|Hardy1923}}  then the counts of [[prime number]]s in short intervals would obey a Poisson distribution.{{r|Gallagher1976}}

{{Anchor|law of rare events}}

=== Law of rare events ===
{{main|Poisson limit theorem}}
[[File:Binomial versus poisson.svg|right|upright=1.5|thumb |Comparison of the Poisson distribution (black lines) and the [[binomial distribution]] with {{nobr| {{mvar|n}} {{=}} 10 }} (red circles), {{nobr| {{mvar|n}} {{=}} 20 }} (blue circles), {{nobr| {{mvar|n}} {{=}} 1000 }} (green circles). All distributions have a mean of&nbsp;5. The horizontal axis shows the number of events&nbsp;{{mvar|k}}. As {{mvar|n}} gets larger, the Poisson distribution becomes an increasingly better approximation for the binomial distribution with the same mean.]]

The rate of an event is related to the probability of an event occurring in some small subinterval (of time, space or otherwise). In the case of the Poisson distribution, one assumes that there exists a small enough subinterval for which the probability of an event occurring twice is "negligible". With this assumption one can derive the Poisson distribution from the binomial one, given only the information of expected number of total events in the whole interval.

Let the total number of events in the whole interval be denoted by <math>\lambda.</math> Divide the whole interval into <math>n</math> subintervals <math>I_1,\dots,I_n</math> of equal size, such that <math>n > \lambda</math> (since we are interested in only very small portions of the interval this assumption is meaningful). This means that the expected number of events in each of the {{mvar|n}} subintervals is equal to <math>\lambda/n.</math>

Now we assume that the occurrence of an event in the whole interval can be seen as a sequence of {{mvar|n}} [[Bernoulli trial]]s, where the <math>i</math>-th [[Bernoulli trial]] corresponds to looking whether an event happens at the subinterval <math>I_i</math> with probability <math>\lambda/n.</math> The expected number of total events in <math>n</math> such trials would be <math>\lambda,</math> the expected number of total events in the whole interval. Hence for each subdivision of the interval we have approximated the occurrence of the event as a Bernoulli process of the form <math>\textrm{B}(n,\lambda/n).</math> As we have noted before we want to consider only very small subintervals. Therefore, we take the limit as <math>n</math> goes to infinity.

In this case the [[binomial distribution]] converges to what is known as the Poisson distribution by the [[Poisson limit theorem]].

In several of the above examples — such as, the number of mutations in a given sequence of DNA—the events being counted are actually the outcomes of discrete trials, and would more precisely be modelled using the [[binomial distribution]], that is
<math display="block">X \sim \textrm{B}(n,p).</math>

In such cases {{mvar|n}} is very large and {{mvar|p}} is very small (and so the expectation {{mvar|n p}} is of intermediate magnitude). Then the distribution may be approximated by the less cumbersome Poisson distribution <math display="block">X \sim \textrm{Pois}(np).</math>

This approximation is sometimes known as the ''law of rare events'',{{r|Cameron1998|p=5}} since each of the {{mvar|n}} individual [[Bernoulli distribution|Bernoulli events]] rarely occurs.

The name "law of rare events" may be misleading because the total count of success events in a Poisson process need not be rare if the parameter {{mvar|n p}} is not small. For example, the number of telephone calls to a busy switchboard in one hour follows a Poisson distribution with the events appearing frequent to the operator, but they are rare from the point of view of the average member of the population who is very unlikely to make a call to that switchboard in that hour.

The variance of the binomial distribution is 1 − ''p'' times that of the Poisson distribution, so almost equal when ''p'' is very small.

The word ''law'' is sometimes used as a synonym of [[probability distribution]], and ''convergence in law'' means ''convergence in distribution''. Accordingly, the Poisson distribution is sometimes called the "law of small numbers" because it is the probability distribution of the number of occurrences of an event that happens rarely but has very many opportunities to happen. ''The Law of Small Numbers'' is a book by Ladislaus Bortkiewicz about the Poisson distribution, published in 1898.{{r|vonBortkiewitsch1898}}{{r|Edgeworth1913}}

=== Poisson point process ===

{{Main|Poisson point process}}

The Poisson distribution arises as the number of points of a [[Poisson point process]] located in some finite region. More specifically, if ''D'' is some region space, for example Euclidean space '''R'''<sup>''d''</sup>, for which |''D''|, the area, volume or, more generally, the Lebesgue measure of the region is finite, and if {{nobr| {{math|''N''(''D'')}} }} denotes the number of points in ''D'', then

: <math> P(N(D)=k)=\frac{(\lambda|D|)^k e^{-\lambda|D|}}{k!} .</math>

=== Poisson regression and negative binomial regression ===

[[Poisson regression]] and [[negative binomial]] regression are useful for analyses where the dependent (response) variable is the count {{nobr| (0, 1, 2, ... ) }} of the number of events or occurrences in an interval.

=== Biology ===
The [[Luria–Delbrück experiment]] tested against the hypothesis of Lamarckian evolution, which should result in a Poisson distribution. 

Katz and Miledi measured the [[membrane potential]] with and without the presence of [[acetylcholine]] (ACh).<ref>{{Cite journal |last1=Katz |first1=B. |last2=Miledi |first2=R. |date=August 1972 |title=The statistical nature of the acetylcholine potential and its molecular components |url=http://dx.doi.org/10.1113/jphysiol.1972.sp009918 |journal=The Journal of Physiology |volume=224 |issue=3 |pages=665–699 |doi=10.1113/jphysiol.1972.sp009918 |pmid=5071933 |pmc=1331515 |issn=0022-3751}}</ref> When ACh is present, [[Ion channel|ion channels]] on the membrane would be open randomly at a small fraction of the time. As there are a large number of ion channels each open for a small fraction of the time, the total number of ion channels open at any moment is Poisson distributed. When ACh is not present, effectively no ion channels are open. The membrane potential is <math>V = N_{\text{open}} V_{\text{ion}} + V_0 + V_{\text{noise}}</math>. Subtracting the effect of noise, Katz and Miledi found the mean and variance of membrane potential to be <math>8.5 \times 10^{-3}\; \mathrm{V}, (29.2 \times 10^{-6}\; \mathrm{V})^2</math>, giving <math>V_{\text{ion}} = 10^{-7}\;\mathrm{V}</math>. (pp. 94-95 <ref name=":0">{{Cite book |last1=Nelson |first1=Philip Charles |url=https://www.worldcat.org/title/891121698 |title=Physical models of living systems |last2=Bromberg |first2=Sarina |last3=Hermundstad |first3=Ann |last4=Prentice |first4=Jason |date=2015 |publisher=W.H. Freeman & Company, a Macmillan Education Imprint |isbn=978-1-4641-4029-7 |location=New York, NY |oclc=891121698}}</ref>)

During each cellular replication event, the number of mutations is roughly Poisson distributed.<ref>{{Citation |last=Foster |first=Patricia L. |title=DNA Repair, Part B |chapter=Methods for Determining Spontaneous Mutation Rates |series=Methods in Enzymology |date=2006-01-01 |volume=409 |pages=195–213 |publisher=Academic Press|doi=10.1016/S0076-6879(05)09012-9 |pmid=16793403 |pmc=2041832 |isbn=978-0-12-182814-1 }}</ref> For example, the HIV virus has 10,000 base pairs, and has a mutation rate of about 1 per 30,000 base pairs, meaning the number of mutations per replication event is distributed as <math>\mathrm{Pois}(1/3)</math>. (p. 64 <ref name=":0" />)

=== Other applications in science ===

In a Poisson process, the number of observed occurrences fluctuates about its mean {{mvar|λ}} with a [[standard deviation]] <math>\sigma_k =\sqrt{\lambda}.</math> These fluctuations are denoted as ''Poisson noise'' or (particularly in electronics) as ''[[shot noise]]''.

The correlation of the mean and standard deviation in counting independent discrete occurrences is useful scientifically. By monitoring how the fluctuations vary with the mean signal, one can estimate the contribution of a single occurrence, ''even if that contribution is too small to be detected directly''. For example, the charge ''e'' on an electron can be estimated by correlating the magnitude of an [[electric current]] with its [[shot noise]]. If ''N'' electrons pass a point in a given time ''t'' on the average, the [[mean]] [[Electric current|current]] is <math>I=eN/t</math>; since the current fluctuations should be of the order <math>\sigma_I = e\sqrt{N}/t</math> (i.e., the standard deviation of the [[Poisson process]]), the charge <math>e</math> can be estimated from the ratio <math>t\sigma_I^2/I.</math>{{Citation needed|date=April 2012}}

An everyday example is the graininess that appears as photographs are enlarged; the graininess is due to Poisson fluctuations in the number of reduced [[silver]] grains, not to the individual grains themselves. By [[Correlation|correlating]] the graininess with the degree of enlargement, one can estimate the contribution of an individual grain (which is otherwise too small to be seen unaided).{{cn|date=February 2024}}

In [[causal set]] theory the discrete elements of spacetime follow a Poisson distribution in the volume.

The Poisson distribution also appears in [[quantum mechanics]], especially [[quantum optics]]. Namely, for a [[quantum harmonic oscillator]] system in a [[coherent state]], the probability of measuring a particular energy level has a Poisson distribution.

==Computational methods==

The Poisson distribution poses two different tasks for dedicated software libraries: ''evaluating'' the distribution <math>P(k;\lambda)</math>, and ''drawing random numbers'' according to that distribution.

=== Evaluating the Poisson distribution ===
Computing <math>P(k;\lambda)</math> for given <math>k</math> and <math>\lambda</math> is a trivial task that can be accomplished by using the standard definition of <math>P(k;\lambda)</math> in terms of exponential, power, and factorial functions. However, the conventional definition of the Poisson distribution contains two terms that can easily overflow on computers: {{mvar|λ}}<sup>{{mvar|k}}</sup> and {{math|''k''!}}. The fraction of {{mvar|λ}}<sup>{{mvar|k}}</sup> to {{mvar|k}}! can also produce a rounding error that is very large compared to ''e''<sup>−{{mvar|λ}}</sup>, and therefore give an erroneous result. For numerical stability the Poisson probability mass function should therefore be evaluated as
:<math>\!f(k; \lambda)= \exp \left[ k\ln \lambda  - \lambda  - \ln \Gamma (k+1) \right],</math>
which is mathematically equivalent but numerically stable. The natural logarithm of the [[Gamma function]] can be obtained using the <code>lgamma</code> function in the [[C (programming language)|C]] standard library (C99 version) or [[R (programming language)|R]], the <code>gammaln</code> function in [[MATLAB]] or [[SciPy]], or the <code>log_gamma</code> function in [[Fortran]] 2008 and later.

Some computing languages provide built-in functions to evaluate the Poisson distribution, namely
* [[R (programming language)|R]]: function <code>dpois(x, lambda)</code>;
* [[Microsoft Excel|Excel]]: function <code>POISSON( x, mean, cumulative)</code>, with a flag to specify the cumulative distribution;
* [[Mathematica]]: univariate Poisson distribution as <code>PoissonDistribution[<math>\lambda</math>]</code>,<ref name="WLPoissonRefPage">{{cite web |url = http://reference.wolfram.com/language/ref/PoissonDistribution.html |title = Wolfram Language: PoissonDistribution reference page |website = wolfram.com |access-date = 2016-04-08 }}</ref> bivariate Poisson distribution as <code>MultivariatePoissonDistribution[<math>\theta_{12},</math>{ <math>\theta_1 - \theta_{12},</math> <math>\theta_2 - \theta_{12}</math>}]</code>,.<ref name="WLMvPoissonRefPage">{{cite web |url = http://reference.wolfram.com/language/ref/MultivariatePoissonDistribution.html |title = Wolfram Language: MultivariatePoissonDistribution reference page |website = wolfram.com |access-date = 2016-04-08 }}</ref>

=== Random variate generation ===
{{further|Non-uniform random variate generation}}

The less trivial task is to draw integer [[random variate]] from the Poisson distribution with given <math>\lambda.</math>

Solutions are provided by:
* [[R (programming language)|R]]: function <code>rpois(n, lambda)</code>;
* [[GNU Scientific Library]] (GSL): function [https://www.gnu.org/software/gsl/doc/html/randist.html#the-poisson-distribution gsl_ran_poisson]

A simple algorithm to generate random Poisson-distributed numbers ([[pseudo-random number sampling]]) has been given by [[Donald Knuth|Knuth]]:{{r|Knuth1997|p=137-138}}

 '''algorithm''' ''poisson random number (Knuth)'':
     '''init''':
         '''Let''' L ← ''e''<sup>−λ</sup>, k ← 0 and p ← 1.
     '''do''':
         k ← k + 1.
         Generate uniform random number u in [0,1] and '''let''' p ← p × u.
     '''while''' p > L.
     '''return''' k − 1.

The complexity is linear in the returned value {{mvar|k}}, which is {{mvar|λ}} on average.  There are many other algorithms to improve this. Some are given in Ahrens & Dieter, see {{slink||References}} below.

For large values of {{mvar|λ}}, the value of {{mvar|L}} = ''e''<sup>−{{mvar|λ}}</sup> may be so small that it is hard to represent.  This can be solved by a change to the algorithm which uses an additional parameter STEP such that ''e''<sup>−STEP</sup> does not underflow: {{Citation needed|reason=Original source is missing|date=March 2019}}

 '''algorithm''' ''poisson random number (Junhao, based on Knuth)'':
     '''init''':
         '''Let''' {{mvar|λ}}Left ← {{mvar|λ}}, k ← 0 and p ← 1.
     '''do''':
         k ← k + 1.
         Generate uniform random number u in (0,1) and '''let''' p ← p × u.
         '''while''' p < 1 and {{mvar|λ}}Left > 0:
             '''if''' {{mvar|λ}}Left > STEP:
                 p ← p × ''e''<sup>STEP</sup>
                 {{mvar|λ}}Left ← {{mvar|λ}}Left − STEP
             '''else''':
                 p ← p × ''e''<sup>{{mvar|λ}}Left</sup>
                 {{mvar|λ}}Left ← 0
     '''while''' p > 1.
     '''return''' k − 1.

The choice of STEP depends on the threshold of overflow. For double precision floating point format the threshold is near ''e''<sup>700</sup>, so 500 should be a safe ''STEP''.

Other solutions for large values of {{mvar|λ}} include [[rejection sampling]] and using Gaussian approximation.

[[Inverse transform sampling]] is simple and efficient for small values of {{mvar|λ}}, and requires only one uniform random number ''u'' per sample. Cumulative probabilities are examined in turn until one exceeds ''u''.

 '''algorithm''' ''Poisson generator based upon the inversion by sequential search'':{{r|Devroye1986|p=505}}
     '''init''':
         '''Let''' x ← 0, p ← ''e''<sup>−λ</sup>, s ← p.
         Generate uniform random number u in [0,1].
     '''while''' u > s '''do''':
         x ← x + 1.
         p ← p × {{mvar|λ}} / x.
         s ← s + p.
     '''return''' x.

== See also ==
{{div col |colwidth = 15em }}
* [[Binomial distribution]]
* [[Compound Poisson distribution]]
* [[Conway–Maxwell–Poisson distribution]]
* [[Erlang distribution]]
* [[Exponential distribution]]
* [[Gamma distribution]]
* [[Hermite distribution]]
* [[Index of dispersion]]
* [[Negative binomial distribution]]
* [[Poisson clumping]]
* [[Poisson point process]]
* [[Poisson regression]]
* [[Poisson sampling]]
* [[Poisson wavelet]]
* [[Queueing theory]]
* [[Renewal theory]]
* [[Robbins lemma]]
* [[Skellam distribution]]
* [[Tweedie distribution]]
* [[Zero-inflated model]]
* [[Zero-truncated Poisson distribution]]
{{div col end}}

== References ==
=== Citations ===
{{Reflist
|refs =
<ref name=Haight1967>
{{cite book
 |last1=Haight |first1=Frank A.
 |title=Handbook of the Poisson Distribution
 |publisher=John Wiley & Sons
 |location=New York, NY, US
 |year=1967
 |isbn=978-0-471-33932-8
}}
</ref>
<ref name=Poisson1837>
{{cite book
 |last1=Poisson |first1=Siméon D.
 |title=Probabilité des jugements en matière criminelle et en matière civile, précédées des règles générales du calcul des probabilités
 |trans-title=Research on the Probability of Judgments in Criminal and Civil Matters
 |language=fr
 |publisher=Bachelier
 |location=Paris, France
 |year=1837
 |url=https://gallica.bnf.fr/ark:/12148/bpt6k110193z/f218.image
}}
</ref>
<ref name=Ugarte2016>
{{cite book
 |last1=Ugarte   |first1=M.D. |author1-link=María Dolores Ugarte
 |last2=Militino |first2=A.F. |author2-link=Ana Fernández Militino
 |last3=Arnholt  |first3=A.T.
 |title=Probability and Statistics with R
 |edition=2nd
 |year=2016
 |publisher=CRC Press
 |location=Boca Raton, FL, US
 |isbn=978-1-4665-0439-4
}}
</ref>
<ref name=deMoivre1711>
{{cite journal
 |last1=de Moivre |first1=Abraham
 |title=De mensura sortis, seu, de probabilitate eventuum in ludis a casu fortuito pendentibus
 |trans-title=On the Measurement of Chance, or, on the Probability of Events in Games Depending Upon Fortuitous Chance
 |language=la
 |journal=[[Philosophical Transactions of the Royal Society]]
 |year=1711 |volume=27 |issue=329 |pages=213–264
 |doi=10.1098/rstl.1710.0018
 |doi-access=free
}}</ref>
<ref name=deMoivre1718>
{{cite book
 |last1=de Moivre |first1=Abraham
 |year=1718
 |title=The Doctrine of Chances: Or, A Method of Calculating the Probability of Events in Play
 |publisher=W. Pearson
 |location=London, Great Britain
 |isbn=9780598843753
 |url=https://books.google.com/books?id=3EPac6QpbuMC&pg=PA14
}}
</ref>
<ref name=deMoivre1721>
{{cite book
 |last1=de Moivre |first1=Abraham
 |year=1721
 |chapter=Of the Laws of Chance
 |title=The Philosophical Transactions from the Year MDCC (where Mr. Lowthorp Ends) to the Year MDCCXX. Abridg'd, and Dispos'd Under General Heads
 |volume=I
 |language=la
 |editor-last1=Motte |editor-first1=Benjamin
 |publisher=R. Wilkin, R. Robinson, S. Ballard, W. and J. Innys, and J. Osborn
 |location=London, Great Britain
 |pages=190–219
}}
</ref>
<ref name="Johnson2005">
{{cite book
 |last1=Johnson |first1=Norman L.
 |last2=Kemp    |first2=Adrienne W.
 |last3=Kotz    |first3=Samuel
 |chapter=Poisson Distribution
 |year=2005 |pages=156–207
 |title=Univariate Discrete Distributions
 |edition=3rd
 |publisher=John Wiley & Sons, Inc. 
 |location=New York, NY, US
 |isbn=978-0-471-27246-5
 |doi=10.1002/0471715816
}}
</ref>
<ref name=Helske2017>
{{cite journal
 |last=Helske |first=Jouni
 |date=2017
 |title=KFAS: Exponential Family State Space Models in R
 |journal=Journal of Statistical Software
 |volume=78 |issue=10
 |doi=10.18637/jss.v078.i10
 |doi-access=free
 |arxiv=1612.01907
 |s2cid=14379617
}}
</ref>
<ref name=Stigler1982>
{{cite journal
 |last1=Stigler |first1=Stephen M. 
 |title=Poisson on the Poisson Distribution
 |journal=Statistics & Probability Letters
 |year=1982 |volume=1 |issue=1 |pages=33–35
 |doi=10.1016/0167-7152(82)90010-4
}}
</ref>
<ref name=Hald1984>
{{cite journal
 |last1=Hald |first1=Anders
 |last2=de Moivre |first2=Abraham
 |last3=McClintock |first3=Bruce
 |title=A. de Moivre: 'De Mensura Sortis' or 'On the Measurement of Chance'
 |journal=International Statistical Review / Revue Internationale de Statistique
 |year=1984 |volume=52 |issue=3 |pages=229–262
 |doi=10.2307/1403045
 |jstor=1403045
}}</ref>
<ref name=Newcomb1860>
{{cite journal
 |last1=Newcomb |first1=Simon
 |year=1860
 |title=Notes on the theory of probabilities
 |journal=The Mathematical Monthly
 |volume=2 |issue=4 |pages=134–140
 |url=https://babel.hathitrust.org/cgi/pt?id=nyp.33433069075590&seq=150
}}
</ref>
<ref name=vonBortkiewitsch1898>
{{cite book
 |last1=von Bortkiewitsch |first1=Ladislaus <!-- This is the spelling of the name as it appears in the book, the Polish version would be Vladislav Bortkevič --> 
 |title=Das Gesetz der kleinen Zahlen
 |trans-title=The law of small numbers
 |language=de
 |publisher=B.G.&nbsp;Teubner |location=Leipzig, Germany
 |year=1898 
 |pages=1, 23–25}}
:On [https://digibus.ub.uni-stuttgart.de/viewer/object/1543508614348/13 page 1], Bortkiewicz presents the Poisson distribution.
: On [https://digibus.ub.uni-stuttgart.de/viewer/object/1543508614348/35 pages 23–25], Bortkiewitsch presents his analysis of "4. Beispiel: Die durch Schlag eines Pferdes im preußischen Heere Getöteten." [4. Example: Those killed in the Prussian army by a horse's kick.]
</ref>
<ref name=Lehmann1986>
{{cite book
 |last1=Lehmann |first1=Erich Leo
 |title=Testing Statistical Hypotheses
 |publisher=Springer Verlag |location=New York, NJ, US
 |edition=2nd
 |year=1986
 |isbn=978-0-387-94919-2
}}
</ref>
<ref name=Yates2014>
{{cite book
 |last1=Yates |first1=Roy D.
 |last2=Goodman |first2=David J.
 |title=Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers
 |year=2014
 |publisher=Wiley
 |location=Hoboken, NJ
 |edition=2nd |isbn=978-0-471-45259-1
}}
</ref>
<ref name=Choi1994>
{{cite journal
 |last1=Choi |first1=Kwok P.
 |title=On the medians of gamma distributions and an equation of Ramanujan
 |journal=Proceedings of the American Mathematical Society
 |year=1994 |volume=121 |issue=1 |pages=245–251
 |doi=10.2307/2160389 |doi-access=free
 |jstor=2160389
}}
</ref>
<ref name=Riordan1937>
{{cite journal
 |last=Riordan | first=John
 |journal=Annals of Mathematical Statistics
 |title=Moment Recurrence Relations for Binomial, Poisson and Hypergeometric Frequency Distributions
 |year=1937 |volume=8 |issue=2 |pages=103–111
 |jstor=2957598
 |doi=10.1214/aoms/1177732430 |doi-access=free
 |url=https://projecteuclid.org/download/pdf_1/euclid.aoms/1177732430
 |format=PDF
}}
</ref>
<ref name=Raikov1937>
{{cite journal
 |last=Raikov |first=Dmitry
 |title=On the decomposition of Poisson laws
 |journal=Comptes Rendus de l'Académie des Sciences de l'URSS
 |year=1937 |volume=14 |pages=9–11
}}
</ref>
<ref name=vonMises1964>
{{cite book
 |last=von Mises |first=Richard
 |title=Mathematical Theory of Probability and Statistics
 |year=1964
 |publisher=Academic Press
 |location=New York, NJ, US
 |isbn=978-1-4832-3213-3
 |doi=10.1016/C2013-0-12460-9
}}
</ref>
<ref name=Kamath2015>
{{cite conference
 |last1=Kamath  |first1=Govinda M.
 |last2=Şaşoğlu |first2=Eren
 |last3=Tse     |first3=David
 |date=14–19 June 2015
 |title=Optimal haplotype assembly from high-throughput mate-pair reads
 |pages=914–918
 |conference=2015 IEEE International Symposium on Information Theory (ISIT)
 |place=Hong Kong, China
 |doi=10.1109/ISIT.2015.7282588
 |arxiv=1502.01975 |s2cid=128634
}}
</ref>
<ref name=Laha1979>
{{cite book
 |last1=Laha |first1=Radha G.
 |last2=Rohatgi |first2=Vijay K.
 |year=1979
 |title=Probability Theory
 |publisher=John Wiley & Sons
 |location=New York, NJ, US
 |isbn=978-0-471-03262-5
}}
</ref>
<ref name=Mitzenmacher2005>
{{cite book
 |last1=Mitzenmacher |first1=Michael |author-link1=Michael Mitzenmacher
 |last2=Upfal |first2=Eli |author-link2=Eli Upfal
 |year=2005
 |title=Probability and Computing: Randomized Algorithms and Probabilistic Analysis
 |publisher=Cambridge University Press 
 |location=Cambridge, UK
 |isbn=978-0-521-83540-4
}}</ref>
<ref name=NIST2006>
{{cite book
 |last1=Prins |first1=Jack
 |chapter=6.3.3.1. Counts Control Charts
 |title=e-Handbook of Statistical Methods
 |chapter-url=http://www.itl.nist.gov/div898/handbook/pmc/section3/pmc331.htm
 |date=2012
 |publisher=NIST/SEMATECH
 |access-date=2019-09-20
}}
</ref>
<ref name=Zhang2013>
{{cite journal
 |last1=Zhang |first1=Huiming
 |last2=Liu   |first2=Yunxiao
 |last3=Li    |first3=Bo 
 |year=2014
 |title=Notes on discrete compound Poisson model with applications to risk theory
 |journal=Insurance: Mathematics and Economics 
 |volume=59 |pages=325–336
 |doi=10.1016/j.insmatheco.2014.09.012
}}
</ref>
<ref name=Zhang2016>
{{cite journal
 |last1=Zhang |first1=Huiming
 |last2=Li    |first2=Bo 
 |title=Characterizations of discrete compound Poisson distributions
 |journal=Communications in Statistics - Theory and Methods
 |year=2016 |volume=45 |issue=22 |pages=6789–6802
 |doi=10.1080/03610926.2014.901375
 |s2cid=125475756
}}
</ref>
<ref name=McCullagh1989>
{{cite book
 |last1=McCullagh |first1=Peter |author-link1=Peter McCullagh
 |last2=Nelder |first2=John |author-link2=John Nelder
 |year=1989
 |title = Generalized Linear Models
 |publisher=Chapman and Hall
 |location=London, UK
 |series=Monographs on Statistics and Applied Probability
 |volume=37
 |isbn=978-0-412-31760-6
}}
</ref>
<ref name=Anscombe1948>
{{cite journal
 |last=Anscombe |first=Francis J. |author-link=Frank Anscombe
 |year=1948
 |title=The transformation of Poisson, binomial and negative binomial data
 |journal=Biometrika
 |volume=35 |issue=3–4 |pages=246–254
 |jstor=2332343  |doi=10.1093/biomet/35.3-4.246
}}
</ref>
<ref name=Ross2010>
{{cite book
 |last1=Ross |first1=Sheldon M.
 |year=2010
 |title=Introduction to Probability Models
 |edition=10th
 |publisher=Academic Press
 |location=Boston, MA 
 |isbn=978-0-12-375686-2
}}
</ref>
<ref name=Rasch1963>
{{cite conference
 |last1=Rasch |first1=Georg
 |year=1963
 |title=The Poisson Process as a Model for a Diversity of Behavioural Phenomena
 |conference=17th International Congress of Psychology
 |publisher=American Psychological Association
 |location=Washington, DC
 |volume=2 
 |doi=10.1037/e685262012-108 <!-- doi leads to a paywall -->
 |url=http://www.rasch.org/memo1963.pdf
}}
</ref>
<ref name=Flory1940>
{{cite journal
 |last1=Flory |first1=Paul J.
 |year=1940
 |title=Molecular Size Distribution in Ethylene Oxide Polymers
 |journal=Journal of the American Chemical Society
 |volume=62 |issue=6 |pages=1561–1565
 |doi=10.1021/ja01863a066
|bibcode=1940JAChS..62.1561F
 }}
</ref>
<ref name=Lomnitz1994>
{{cite book
 |last=Lomnitz |first=Cinna
 |year=1994
 |title=Fundamentals of Earthquake Prediction
 |publisher=John Wiley & Sons
 |location=New York, NY
 |oclc=647404423 |isbn=0-471-57419-8
}}
</ref>
<ref name=Student1907>
{{cite journal
 |author=a student |author-link=William Sealy Gosset
 |year=1907
 |title=On the error of counting with a haemacytometer
 |journal=Biometrika
 |volume=5 |issue=3 |pages=351–360
 |jstor=2331633  |doi=10.2307/2331633
 |url=https://zenodo.org/record/1620891
}}
</ref>
<ref name=Boland1984>
{{cite journal
 |last=Boland |first=Philip J.
 |year=1984
 |title=A biographical glimpse of William Sealy Gosset
 |journal=The American Statistician
 |volume=38 |issue=3 |pages=179–183
 |jstor=2683648  |doi=10.1080/00031305.1984.10483195
}}
</ref>
<ref name=Erlang1909>
{{cite journal
 |last1=Erlang |first1=Agner K.
 |year=1909
 |title=Sandsynlighedsregning og Telefonsamtaler
 |trans-title=Probability Calculation and Telephone Conversations
 |language=da
 |journal=Nyt Tidsskrift for Matematik
 |volume=20 |issue=B |pages=33–39 
 |jstor=24528622
}}
</ref>
<ref name=Hornby2014>
{{cite web
 |last=Hornby |first=Dave
 |year=2014 
 |title=Football Prediction Model: Poisson Distribution
 |publisher=Sports Betting Online
 |url=http://www.sportsbettingonline.net/strategy/football-prediction-model-poisson-distribution
 |access-date=2014-09-19
}}
</ref>
<ref name=Koyama2016>
{{cite journal
 |last1=Koyama   |first1=Kento
 |last2=Hokunan  |first2=Hidekazu
 |last3=Hasegawa |first3=Mayumi
 |last4=Kawamura |first4=Shuso
 |last5=Koseki   |first5=Shigenobu
 |year=2016
 |title=Do bacterial cell numbers follow a theoretical Poisson distribution? Comparison of experimentally obtained numbers of single cells with random number generation via computer simulation
 |journal=Food Microbiology
 |volume=60 |pages=49–53
 |doi=10.1016/j.fm.2016.05.019  |pmid=27554145
}}
</ref>
<ref name=Clarke1946>
{{cite journal
 |last1=Clarke |first1=R. D. 
 |year=1946
 |title=An application of the Poisson distribution
 |journal=Journal of the Institute of Actuaries
 |volume=72 |issue=3 |page=481
 |doi=10.1017/S0020268100035435 |doi-access=free
 |url=https://www.actuaries.org.uk/system/files/documents/pdf/0481.pdf
}}
</ref>
<ref name=Gallagher1976>
{{cite journal
 |last=Gallagher |first=Patrick X.
 |title=On the distribution of primes in short intervals
 |journal=[[Mathematika]]
 |year=1976 |volume=23 |issue=1 |pages=4–9 
 |doi=10.1112/s0025579300016442
}}
</ref>
<ref name=Hardy1923>
{{cite journal
 |last1=Hardy      |first1=Godfrey H. |author-link1=G. H. Hardy 
 |last2=Littlewood |first2=John E.    |author-link2=John Edensor Littlewood
 |year=1923
 |title=On some problems of "partitio numerorum" III: On the expression of a number as a sum of primes
 |journal=Acta Mathematica
 |volume=44 |pages=1–70 
 |doi=10.1007/BF02403921  |doi-access=free
}}
</ref>
<ref name=Cameron1998>
{{cite book
 |last1=Cameron  |first1=A. Colin 
 |last2=Trivedi  |first2=Pravin K. 
 |year=1998
 |title=Regression Analysis of Count Data
 |publisher=Cambridge University Press
 |location=Cambridge, UK
 |isbn=978-0-521-63567-7
 |url=https://books.google.com/books?id=SKUXe_PjtRMC&pg=PA5
}}
</ref>
<ref name=Edgeworth1913>
{{cite journal
 |last=Edgeworth |first=F.Y.  |author-link=Francis Ysidro Edgeworth
 |title=On the use of the theory of probabilities in statistics relating to society 
 |journal=[[Journal of the Royal Statistical Society]]
 |year=1913
 |volume=76 |issue=2 |pages=165–193
 |jstor=2340091 |doi=10.2307/2340091
 |url=https://zenodo.org/record/1449478
}}
</ref>
<ref name=Knuth1997>
{{cite book
 |last=Knuth |first=Donald Ervin
 |year=1997
 |title = Seminumerical Algorithms
 |edition=3rd
 |series=[[The Art of Computer Programming]]
 |volume=2
 |publisher=[[Addison Wesley]]
 |isbn=978-0-201-89684-8
}}
</ref>
<ref name=Devroye1986>
{{cite book
 |last=Devroye |first=Luc |chapter=Discrete Univariate Distributions |author-link=Luc Devroye
 |year=1986
 |title=Non-Uniform Random Variate Generation
 |publisher=Springer-Verlag
 |place=New York, NY
 |pages=485–553
 |doi=10.1007/978-1-4613-8643-8_10
 |isbn=978-1-4613-8645-2
 |chapter-url=http://luc.devroye.org/chapter_ten.pdf
 |url=http://luc.devroye.org/rnbookindex.html
}}
</ref>
<ref name=Garwood1936>
{{cite journal
 |last=Garwood |first=Frank
 |year=1936
 |title=Fiducial Limits for the Poisson Distribution
 |journal=Biometrika
 |volume=28 |issue=3/4 |pages=437–442
 |doi=10.1093/biomet/28.3-4.437
 |jstor=2333958
}}
</ref>
<ref name=Breslow1987>
{{cite book
 |last1=Breslow |first1=Norman E. |author-link1=Norman Breslow
 |last2=Day     |first2=Nick E.   |author-link2=Nick Day (statistician)
 |year=1987
 |title=Statistical Methods in Cancer Research
 |volume=2 — The Design and Analysis of Cohort Studies
 |publisher=[[International Agency for Research on Cancer]]
 |location=Lyon, France
 |isbn=978-92-832-0182-3
 |url=http://www.iarc.fr/en/publications/pdfs-online/stat/sp82/index.php
 |access-date=2012-03-11 |archive-url=https://web.archive.org/web/20180808161401/http://www.iarc.fr/en/publications/pdfs-online/stat/sp82/index.php
 |archive-date=2018-08-08
}}
</ref>
<ref name=Fink1976>
{{cite book
 |last=Fink |first=Daniel
 |year=1997
 |title=A Compendium of Conjugate Priors
}}
</ref>
<ref name=Gelman2003>
{{cite book
 |last1=Gelman |last2=Carlin |first2=John B.
 |last3=Stern |first3=Hal S.
 |last4=Rubin |first4=Donald B.
 |year=2003
 |title=Bayesian Data Analysis
 |edition=2nd
 |publisher=Chapman & Hall/CRC
 |location=Boca Raton, FL, US
 |isbn=1-58488-388-X
}}
</ref>
<ref name=Clevenson1975>
{{cite journal
 |last1=Clevenson |first1=M. Lawrence
 |last2=Zidek     |first2=James V.
 |year=1975
 |title=Simultaneous estimation of the means of independent Poisson laws
 |journal=Journal of the American Statistical Association
 |volume=70 |issue=351 |pages=698–705
 |doi=10.1080/01621459.1975.10482497
 |jstor=2285958
}}
</ref>
<ref name=Berger1985>
{{cite book
 |last=Berger |first=James O.
 |year=1985
 |title=Statistical Decision Theory and Bayesian Analysis
 |edition=2nd
 |series=Springer Series in Statistics
 |publisher=Springer-Verlag
 |location=New York, NY 
 |isbn=978-0-387-96098-2    
 |doi=10.1007/978-1-4757-4286-2
 |bibcode=1985sdtb.book.....B
}}
</ref>
<ref name=Loukas1986>
{{cite journal
 |last1=Loukas |first1=Sotirios
 |last2=Kemp |first2=C. David
 |title=The Index of Dispersion Test for the Bivariate Poisson Distribution 
 |journal=Biometrics
 |year=1986 |volume=42 |issue=4 |pages=941–948
 |doi= 10.2307/2530708
 |jstor=2530708
}}</ref>
}}

=== Sources ===
{{refbegin}}
* {{cite journal
 |last1 = Ahrens |first1 = Joachim H.
 |last2 = Dieter |first2 = Ulrich
 |year = 1974
 |title = Computer Methods for Sampling from Gamma, Beta, Poisson and Binomial Distributions
 |journal = Computing
 |volume = 12 |issue = 3 |pages = 223–246
 |doi = 10.1007/BF02293108 |s2cid = 37484126
}}
* {{cite journal
 |last1 = Ahrens |first1 = Joachim H.
 |last2 = Dieter |first2 = Ulrich
 |year = 1982
 |title = Computer Generation of Poisson Deviates
 |journal = ACM Transactions on Mathematical Software
 |volume = 8 |issue = 2 |pages = 163–179
 |doi = 10.1145/355993.355997  |s2cid = 12410131
|doi-access = free}}
* {{cite journal
 |last1 = Evans |first1 = Ronald J.
 |last2 = Boersma |first2 = J.
 |last3 = Blachman |first3 = N. M.
 |last4 = Jagers |first4 = A. A.
 |year = 1988
 |title = The Entropy of a Poisson Distribution: Problem 87-6
 |journal = SIAM Review
 |volume = 30 |issue = 2 |pages = 314–317
 |doi = 10.1137/1030059
 |url = https://research.tue.nl/nl/publications/solution-to-problem-876--the-entropy-of-a-poisson-distribution(94cf6dd2-b35e-41c8-9da7-6ec69ca391a0).html
}}

{{refend}}

{{Clear}}
{{ProbDistributions|discrete-infinite}}

{{Authority control}}

[[Category:1711 introductions]]
[[Category:Poisson distribution| ]]
[[Category:Articles with example pseudocode]]
[[Category:Conjugate prior distributions]]
[[Category:Factorial and binomial topics]]
[[Category:Infinitely divisible probability distributions]]
[[Category:Abraham de Moivre]]