Frequent Links
Poisson distribution
Probability mass function Plot of the Poisson PMFThe horizontal axis is the index k, the number of occurrences. The function is only defined at integer values of k. The connecting lines are only guides for the eye.  
Cumulative distribution function Plot of the Poisson CDFThe horizontal axis is the index k, the number of occurrences. The CDF is discontinuous at the integers of k and flat everywhere else because a variable that is Poisson distributed only takes on integer values.  
Parameters  λ > 0 (real) 

Support  k ∈ { 0, 1, 2, 3, ... } 
pmf  <math>\frac{\lambda^k}{k!} e^{\lambda}</math> 
CDF 
<math>\frac{\Gamma(\lfloor k+1\rfloor, \lambda)}{\lfloor k\rfloor !}</math>, or <math>e^{\lambda} \sum_{i=0}^{\lfloor k\rfloor} \frac{\lambda^i}{i!}\ </math>, or <math>Q(\lfloor k+1\rfloor,\lambda)</math> (for <math>k\ge 0</math>, where <math>\Gamma(x, y)</math> is the incomplete gamma function, <math>\lfloor k\rfloor</math> is the floor function, and Q is the regularized gamma function) 
Mean  <math>\lambda</math> 
Median  <math>\approx\lfloor\lambda+1/30.02/\lambda\rfloor</math> 
Mode  <math>\lceil\lambda\rceil  1, \lfloor\lambda\rfloor</math> 
Variance  <math>\lambda</math> 
Skewness  <math>\lambda^{1/2}</math> 
Ex. kurtosis  <math>\lambda^{1}</math> 
Entropy 
<math>\lambda[1  \log(\lambda)] + e^{\lambda}\sum_{k=0}^\infty \frac{\lambda^k\log(k!)}{k!}</math> (for large <math>\lambda</math>) <math>\frac{1}{2}\log(2 \pi e \lambda)  \frac{1}{12 \lambda}  \frac{1}{24 \lambda^2} </math><math>\qquad \frac{19}{360 \lambda^3} + O\left(\frac{1}{\lambda^4}\right)</math> 
MGF  <math>\exp(\lambda (e^{t}  1))</math> 
CF  <math>\exp(\lambda (e^{it}  1))</math> 
PGF  <math>\exp(\lambda(z  1))</math> 
Fisher information  <math>\lambda^{1}</math> 
In probability theory and statistics, the Poisson distribution (French pronunciation Template:IPAfr; in English usually /ˈpwɑːsɒn/), named after French mathematician Siméon Denis Poisson, is a discrete probability distribution that expresses the probability of a given number of events occurring in a fixed interval of time and/or space if these events occur with a known average rate and independently of the time since the last event.^{[1]} The Poisson distribution can also be used for the number of events in other specified intervals such as distance, area or volume.
For instance, an individual keeping track of the amount of mail they receive each day may notice that they receive an average number of 4 letters per day. If receiving any particular piece of mail doesn't affect the arrival times of future pieces of mail, i.e., if pieces of mail from a wide range of sources arrive independently of one another, then a reasonable assumption is that the number of pieces of mail received per day obeys a Poisson distribution.^{[2]} Other examples that may follow a Poisson: the number of phone calls received by a call center per hour, the number of decay events per second from a radioactive source, or the number of taxis passing a particular street corner per hour.
Contents
History
The distribution was first introduced by Siméon Denis Poisson (1781–1840) and published, together with his probability theory, in 1837 in his work Recherches sur la probabilité des jugements en matière criminelle et en matière civile (“Research on the Probability of Judgments in Criminal and Civil Matters”).^{[3]} The work theorized about the number of wrongful convictions in a given country by focusing on certain random variables N that count, among other things, the number of discrete occurrences (sometimes called "events" or “arrivals”) that take place during a timeinterval of given length. The result had been given previously by Abraham de Moivre (1711) in De Mensura Sortis seu; de Probabilitate Eventuum in Ludis a Casu Fortuito Pendentibus in Philosophical Transactions of the Royal Society, p. 219.^{[4]} This has prompted some authors to argue that the Poisson distribution should bear the name of de Moivre^{[5]}^{[6]}
A practical application of this distribution was made by Ladislaus Bortkiewicz in 1898 when he was given the task of investigating the number of soldiers in the Prussian army killed accidentally by horse kicks; this experiment introduced the Poisson distribution to the field of reliability engineering.^{[7]}
Definition
A discrete random variable X is said to have a Poisson distribution with parameter λ > 0, if, for k = 0, 1, 2, …, the probability mass function of X is given by:^{[8]}
 <math>\!f(k; \lambda)= \Pr(X{=}k)= \frac{\lambda^k e^{\lambda}}{k!},</math>
where
 e is Euler's number (e = 2.71828...)
 k! is the factorial of k.
The positive real number λ is equal to the expected value of X and also to its variance^{[9]}
 <math>\lambda=\operatorname{E}(X)=\operatorname{Var}(X).</math>
The Poisson distribution can be applied to systems with a large number of possible events, each of which is rare. How many such events will occur during a fixed time interval? Under the right circumstances, this is a random number with a Poisson distribution.
Properties
Mean
 The expected value and variance of a Poissondistributed random variable are both equal to λ.
 The coefficient of variation is <math>\textstyle \lambda^{1/2}</math>, while the index of dispersion is 1.^{[4]}
 The mean absolute deviation about the mean is^{[4]}
 <math>\operatorname{E}X\lambda= 2\exp(\lambda) \frac{\lambda^{\lfloor\lambda\rfloor + 1}}{ \lfloor\lambda\rfloor!} .</math>
 The mode of a Poissondistributed random variable with noninteger λ is equal to <math>\scriptstyle\lfloor \lambda \rfloor</math>, which is the largest integer less than or equal to λ. This is also written as floor(λ). When λ is a positive integer, the modes are λ and λ − 1.
 All of the cumulants of the Poisson distribution are equal to the expected value λ. The nth factorial moment of the Poisson distribution is λ^{n}.
Median
Bounds for the median (ν) of the distribution are known and are sharp:^{[10]}
 <math> \lambda  \ln 2 \le \nu < \lambda + \frac{1}{3}. </math>
Higher moments
 The higher moments m_{k} of the Poisson distribution about the origin are Touchard polynomials in λ:
 <math> m_k = \sum_{i=1}^k \lambda^i \left\{\begin{matrix} k \\ i \end{matrix}\right\},</math>
 where the {braces} denote Stirling numbers of the second kind.^{[11]} The coefficients of the polynomials have a combinatorial meaning. In fact, when the expected value of the Poisson distribution is 1, then Dobinski's formula says that the nth moment equals the number of partitions of a set of size n.
 Sums of Poissondistributed random variables:
 If <math>X_i \sim \mathrm{Pois}(\lambda_i)\, i=1,\dots,n</math> are independent, and <math>\lambda=\sum_{i=1}^n \lambda_i</math>, then <math>Y = \left( \sum_{i=1}^n X_i \right) \sim \mathrm{Pois}(\lambda)</math>.^{[12]} A converse is Raikov's theorem, which says that if the sum of two independent random variables is Poissondistributed, then so is each of those two independent random variables.^{[13]}
Other properties
 The Poisson distributions are infinitely divisible probability distributions.^{[14]}^{[15]}
 The directed Kullback–Leibler divergence of Pois(λ_{0}) from Pois(λ) is given by
 <math>D_{\mathrm{KL}}(\lambda\\lambda_0) = \lambda_0  \lambda + \lambda \log \frac{\lambda}{\lambda_0}.</math>
 Bounds for the tail probabilities of a Poisson random variable <math> X \sim \text{Pois}(\lambda)</math> can be derived using a Chernoff bound argument.^{[16]}
 <math> P(X \geq x) \leq \frac{e^{\lambda} (e \lambda)^x}{x^x}, \text{ for } x > \lambda ,</math>
 <math> P(X \leq x) \leq \frac{e^{\lambda} (e \lambda)^x}{x^x}, \text{ for } x < \lambda .</math>
 <math>
\left\{(k+1) f(k+1)\lambda f(k)=0,f(0)=e^{\lambda }\right\} </math>
Poisson Races
Let <math>X \sim Poi(\lambda)</math>, and <math>Y \sim Poi(\mu)</math>, be independent random variables, with <math> \lambda < \mu </math> then we have that,
 <math>
\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(XY\geq0 X+Y=i)</math> is the probability that <math>Z \geq \frac{i}{2}</math>, where <math>Z \sim Bin\left(i, \frac{\lambda}{\lambda+\mu}\right)</math>, which is lower bounded by <math> \frac{1}{(i+1)^2} e^{\left(2D\left(0.5 \frac{\lambda}{\lambda+\mu}\right)\right)} </math>, where <math>D</math> is relative entropy (See the entry on bounds on tails of binomial distributions for details). Further noting that <math> X+Y \sim Poi(\lambda+\mu)</math>, and computing a lower bound on the unconditional probability gives the result.
Related distributions
 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.
 Specifically, given <math>X_1+X_2=k</math>, <math>\!X_1\sim \mathrm{Binom}(k, \lambda_1/(\lambda_1+\lambda_2))</math>.
 More generally, if X_{1}, X_{2},..., X_{n} are independent Poisson random variables with parameters λ_{1}, λ_{2},..., λ_{n} then
 given <math>\sum_{j=1}^n X_j=k,</math> <math>X_i \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 = 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 <math>\{Y_i\} </math>, conditional on X = k, 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 can be derived as a limiting case to the binomial distribution as the number of trials goes to infinity and the expected number of successes remains fixed — see law of rare events below. Therefore it can be used as an approximation of the binomial distribution if n is sufficiently large and p is sufficiently small. There is a rule of thumb stating that the Poisson distribution is a good approximation of the binomial distribution if n is at least 20 and p is smaller than or equal to 0.05, and an excellent approximation if n ≥ 100 and np ≤ 10.^{[17]}
 <math>F_\mathrm{Binomial}(k;n, p) \approx F_\mathrm{Poisson}(k;\lambda=np)\,</math>
 The Poisson distribution is a special case of discrete compound Poisson distribution (or stuttering Poisson distribution) with only a parameter.^{[18]} The discrete compound Poisson distribution can be deduced from the limiting distribution of univariate multinomial distribution. It is also a special case of a compound Poisson distribution.
 For sufficiently large values of λ, (say λ>1000), the normal distribution with mean λ and variance λ (standard deviation <math>\sqrt{\lambda}</math>) is an excellent approximation to the Poisson distribution. If λ is greater than about 10, then the normal distribution is a good approximation if an appropriate continuity correction is performed, i.e., P(X ≤ x), where (lowercase) x is a nonnegative integer, is replaced by P(X ≤ x + 0.5).
 <math>F_\mathrm{Poisson}(x;\lambda) \approx F_\mathrm{normal}(x;\mu=\lambda,\sigma^2=\lambda)\,</math>
 Variancestabilizing transformation: When a variable is Poisson distributed, its square root is approximately normally distributed with expected value of about <math>\sqrt \lambda</math> and variance of about 1/4.^{[19]}^{[20]} Under this transformation, the convergence to normality (as λ increases) is far faster than the untransformed variable.^{[citation needed]} Other, slightly more complicated, variance stabilizing transformations are available,^{[20]} one of which is Anscombe transform. See Data transformation (statistics) for more general uses of transformations.
 If for every t > 0 the number of arrivals in the time interval [0, t] follows the Poisson distribution with mean λt, then the sequence of interarrival times are independent and identically distributed exponential random variables having mean 1/λ.^{[21]}
 The cumulative distribution functions of the Poisson and chisquared distributions are related in the following ways:^{[22]}
 <math>F_\text{Poisson}(k;\lambda) = 1F_{\chi^2}(2\lambda;2(k+1)) \quad\quad \text{ integer } k,</math>
 and^{[23]}
 <math>\Pr(X=k)=F_{\chi^2}(2\lambda;2(k+1)) F_{\chi^2}(2\lambda;2k) .
</math>
Occurrence
Applications of the Poisson distribution can be found in many fields related to counting:^{[24]}
 Telecommunication example: telephone calls arriving in a system.
 Astronomy example: photons arriving at a telescope.
 Biology example: the number of mutations on a strand of DNA per unit length.
 Management example: customers arriving at a counter or call centre.
 Civil engineering example: cars arriving at a traffic light.
 Finance and insurance example: number of Losses/Claims occurring in a given period of Time.
 Earthquake seismology example: an asymptotic Poisson model of seismic risk for large earthquakes. (Lomnitz, 1994).
 Radioactivity example: Decay of a radioactive nucleus.
The Poisson distribution arises in connection with Poisson processes. It applies to various phenomena of discrete properties (that is, those that may happen 0, 1, 2, 3, ... times during a given period of time or in a given area) whenever the probability of the phenomenon happening is constant in time or space. Examples of events that may be modelled as a Poisson distribution include:
 The number of soldiers killed by horsekicks each year in each corps in the Prussian cavalry. This example was made famous by a book of Ladislaus Josephovich Bortkiewicz (1868–1931).
 The number of yeast cells used when brewing Guinness beer. This example was made famous by William Sealy Gosset (1876–1937).^{[25]}
 The number of phone calls arriving at a call centre within a minute. This example was made famous by A.K. Erlang (1878 – 1929).
 Internet traffic.
 The number of goals in sports involving two competing teams.^{[26]}
 The number of deaths per year in a given age group.
 The number of jumps in a stock price in a given time interval.
 Under an assumption of homogeneity, the number of times a web server is accessed per minute.
 The number of mutations in a given stretch of DNA after a certain amount of radiation.
 The proportion of cells that will be infected at a given multiplicity of infection.
 The arrival of photons on a pixel circuit at a given illumination and over a given time period.
 The targeting of V1 flying bombs on London during World War II.^{[27]}
Gallagher in 1976 showed that the counts of prime numbers in short intervals obey a Poisson distribution provided a certain version of an unproved conjecture of Hardy and Littlewood is true.^{[28]}
Law of rare events
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 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 this total number be <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</math> > <math>\lambda</math> (since we are only interested in very small portions of the interval this assumption is meaningful). This means that the expected number of events in an interval <math>I_k</math> for each <math>k</math> 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 Bernoulli trial, where the <math>i^{th}</math> 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>X \sim \textrm{B}(n,p). \,</math>
In such cases n is very large and p is very small (and so the expectation np is of intermediate magnitude). Then the distribution may be approximated by the less cumbersome Poisson distribution^{[citation needed]}
 <math>X \sim \textrm{Pois}(np). \,</math>
This approximation is sometimes known as the law of rare events,^{[29]} since each of the n individual Bernoulli events rarely occurs. The name may be misleading because the total count of success events in a Poisson process need not be rare if the parameter np 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 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 (Bortkevitch)^{[30]} about the Poisson distribution, published in 1898.
Multidimensional Poisson process
The poisson distribution arises as the distribution of counts of occurrences of events in (multidimensional) intervals in multidimensional Poisson processes in a directly equivalent way to the result for unidimensional processes. Thus, if D is any region the multidimensional space for which D, the area or volume of the region, is finite, and if N(D) is count of the number of events in D, then
 <math> P(N(D)=k)=\frac{(\lambdaD)^k e^{\lambdaD}}{k!} .</math>
Other applications in science
In a Poisson process, the number of observed occurrences fluctuates about its mean λ with a standard deviation <math>\sigma_k =\sqrt{\lambda}</math>. These fluctuations are denoted as Poisson noise or (particularly in electronics) as shot noise.^{[citation needed]}
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 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]}
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 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).^{[citation needed]} Many other molecular applications of Poisson noise have been developed, e.g., estimating the number density of receptor molecules in a cell membrane.
 <math>
\Pr(N_t=k) = f(k;\lambda t) = \frac{e^{\lambda t} (\lambda t)^k}{k!} . </math>
In Causal Set theory the discrete elements of spacetime follow a Poisson distribution in the volume.
Generating Poissondistributed random variables
A simple algorithm to generate random Poissondistributed numbers (pseudorandom number sampling) has been given by Knuth (see References below):
algorithm poisson random number (Knuth): init: Let L ← e^{−λ}, 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.
While simple, the complexity is linear in the returned value k, which is λ on average. There are many other algorithms to overcome this. Some are given in Ahrens & Dieter, see References below. Also, for large values of λ, there may be numerical stability issues because of the term e^{−λ}. This could be solved by a slight change to allow λ to be added into the calculation gradually:
algorithm poisson random number (Junhao, based on Knuth): init: Let λLeft ← λ, k ← 0 and p ← 1. do: k ← k + 1. Generate uniform random number u in (0,1) and let p ← p × u. if p < e and λLeft > 0: if λLeft > STEP: p ← p × e^{STEP} λLeft ← λLeft  STEP else: p ← p × e^{λLeft} λLeft ← 1 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^{700}, so 500 shall be a safe STEP.
Other solutions for large values of λ include rejection sampling and using Gaussian approximation.
Inverse transform sampling is simple and efficient for small values of λ, 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:^{[31]} init: Let x ← 0, p ← e^{−λ}, s ← p. Generate uniform random number u in [0,1]. while u > s do: x ← x + 1. p ← p * λ / x. s ← s + p. return x.
"This algorithm ... requires expected time proportional to λ as λ→∞. For large λ, roundoff errors proliferate, which provides us with another reason for avoiding large values of λ."^{[31]}
Parameter estimation
Maximum likelihood
Given a sample of n measured values k_{i} = 0, 1, 2, ..., for i = 1, ..., n, we wish to estimate the value of the parameter λ of the Poisson population from which the sample was drawn. The maximum likelihood estimate is ^{[32]}
 <math>\widehat{\lambda}_\mathrm{MLE}=\frac{1}{n}\sum_{i=1}^n k_i. \!</math>
Since each observation has expectation λ so does this sample mean. Therefore the maximum likelihood estimate is an unbiased estimator of λ. It is also an efficient estimator, i.e. its estimation variance achieves the Cramér–Rao lower bound (CRLB).^{[citation needed]} Hence it is minimumvariance unbiased. Also it can be proved that the sum (and hence the sample mean as it is a onetoone function of the sum) is a complete and sufficient statistic for λ.
To prove sufficiency we may use the 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 e^{\lambda}}{x!}=\frac{1}{\prod_{i=1}^n x_i!} \times \lambda^{\sum_{i=1}^n x_i}e^{n\lambda} </math>
Note that 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>T(\mathbf{x})=\sum_{i=1}^nx_i</math>. Thus, <math>T(\mathbf{x})</math> is sufficient.
To find the parameter λ that maximizes the probability function for the Poisson population, we can use the logarithm of the probability function:
 <math> \begin{align} L(\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 L with respect to λ and compare it to zero:
 <math>\frac{\mathrm{d}}{\mathrm{d}\lambda} L(\lambda) = 0 \iff n + \left(\sum_{i=1}^n k_i\right) \frac{1}{\lambda} = 0. \!</math>
Solving for λ gives a stationary point.
 <math> \lambda = \frac{\sum_{i=1}^n k_i}{n}</math>
So λ is the average of the k_{i} values. Obtaining the sign of the second derivative of L at the stationary point will determine what kind of extreme value λ is.
 <math>\frac{\partial^2 L}{\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 L}{\partial \lambda^2} =  \frac{n^2}{\sum_{i=1}^n k_i} </math>
which is the negative of n times the reciprocal of the average of the k_{i}. This expression is negative when the average is positive. If this is satisfied, then the stationary point maximizes the probability function.
For 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>T(\mathbf{x})=\sum_{i=1}^nX_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, it is obvious that <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 chisquared distributions. The chisquared distribution is itself closely related to the gamma distribution, and this leads to an alternative expression. Given an observation k from a Poisson distribution with mean μ, a confidence interval for μ with confidence level 1 – α is
 <math>\tfrac 12\chi^{2}(\alpha/2; 2k) \le \mu \le \tfrac 12 \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 chisquared distribution with 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.^{[22]}^{[33]} This interval is 'exact' in the sense that its coverage probability is never less than the nominal 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):^{[34]}
 <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 α / 2.
For application of these formulae in the same context as above (given a sample of n measured values k_{i} each drawn from a Poisson distribution with mean λ), one would set
 <math>k=\sum_{i=1}^n k_i ,\!</math>
calculate an interval for μ = nλ, and then derive the interval for λ.
Bayesian inference
In Bayesian inference, the conjugate prior for the rate parameter λ of the Poisson distribution is the gamma distribution.^{[35]} Let
 <math>\lambda \sim \mathrm{Gamma}(\alpha, \beta) \!</math>
denote that λ is distributed according to the gamma 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^{\alpha1} \; e^{\beta\,\lambda} \qquad \text{ for } \lambda>0 \,\!.</math>
Then, given the same sample of n measured values k_{i} 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>
The posterior mean E[λ] approaches the maximum likelihood estimate <math>\widehat{\lambda}_\mathrm{MLE}</math> in the limit as <math>\alpha\to 0,\ \beta\to 0</math>.^{[citation needed]}
The posterior predictive distribution for a single additional observation is a negative binomial distribution,^{[36]} 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>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 famous example for the Normal means, the MLE estimator <math>{\hat \lambda}_i = X_i</math> is inadmissible.^{[37]}
In this case, a family of minimax estimators is given for any <math>0 < c \leq 2(p1)</math> and <math>b \geq (p2+p^{1})</math> as^{[38]}
 <math>{\hat \lambda}_i = \left(1  \frac{c}{b + \sum_{i=1}^p X_i}\right) X_i, \qquad i=1,\dots,p.</math>
Bivariate Poisson distribution
This distribution has been extended to the bivariate case.^{[39]} The generating function for this distribution is
 <math> g( u, v ) = \exp[ ( \theta_1  \theta_{12} )( u  1 ) + ( \theta_2  \theta_{12} )(v  1) + \theta_{12} ( uv  1 ) ] </math>
with
 <math> \theta_1, \theta_2 > \theta_{ 12 } > 0 \, </math>
The marginal distributions are Poisson(θ_{1}) and Poisson(θ_{2}) and the correlation coefficient is limited to the range
 <math> 0 \le \rho \le \min\left\{ \frac{ \theta_1 }{ \theta_2 }, \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>
\begin{align} & \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 \end{align} </math>
See also
 Compound Poisson distribution
 Conway–Maxwell–Poisson distribution
 Erlang distribution
 Hermite distribution
 Index of dispersion
 Negative binomial distribution
 Poisson clumping
 Poisson process
 Poisson regression
 Poisson sampling
 Poisson wavelet
 Queueing theory
 Renewal theory
 Robbins lemma
 Tweedie distribution
 Zeroinflated model
 Zerotruncated Poisson distribution
Notes
 ^ Frank A. Haight (1967). Handbook of the Poisson Distribution. New York: John Wiley & Sons.
 ^ "Statistics  The Poisson Distribution". Umass.edu. 20070824. Retrieved 20140418.
 ^ S.D. Poisson, 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 probabilitiés (Paris, France: Bachelier, 1837), page 206.
 ^ ^{a} ^{b} ^{c} Johnson, N.L., Kotz, S., Kemp, A.W. (1993) Univariate Discrete distributions (2nd edition). Wiley. ISBN 0471548979, p157
 ^ Stigler, Stephen M. "Poisson on the Poisson distribution." Statistics & Probability Letters 1.1 (1982): 3335.
 ^ Hald, Anders, Abraham de Moivre, and Bruce McClintock. "A. de Moivre:'De Mensura Sortis' or'On the Measurement of Chance'." International Statistical Review/Revue Internationale de Statistique (1984): 229262
 ^ Ladislaus von Bortkiewicz, Das Gesetz der kleinen Zahlen [The law of small numbers] (Leipzig, Germany: B.G. Teubner, 1898). On page 1, Bortkiewicz presents the Poisson distribution. On pages 23–25, Bortkiewicz presents his famous analysis of "4. Beispiel: Die durch Schlag eines Pferdes im preussischen Heere Getöteten." (4. Example: Those killed in the Prussian army by a horse's kick.).
 ^ Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers, Roy D. Yates, David Goodman, page 60.
 ^ For the proof, see : Proof wiki: expectation and Proof wiki: variance
 ^ Choi KP (1994) On the medians of Gamma distributions and an equation of Ramanujan. Proc Amer Math Soc 121 (1) 245–251
 ^ Riordan, John (1937). "Moment recurrence relations for binomial, Poisson and hypergeometric frequency distributions". Annals of Mathematical Statistics 8: 103–111. doi:10.1214/aoms/1177732430. Also see Haight (1967), p. 6.
 ^ E. L. Lehmann (1986). Testing Statistical Hypotheses (second ed.). New York: Springer Verlag. ISBN 0387949194. page 65.
 ^ Raikov, D. (1937). On the decomposition of Poisson laws. Comptes Rendus (Doklady) de l' Academie des Sciences de l'URSS, 14, 9–11. (The proof is also given in von Mises, Richard (1964). Mathematical Theory of Probability and Statistics. New York: Academic Press.)
 ^ Laha, R. G. and Rohatgi, V. K. Probability Theory. New York: John Wiley & Sons. p. 233. ISBN 047103262X.
 ^ Johnson, N.L., Kotz, S., Kemp, A.W. (1993) Univariate Discrete distributions (2nd edition). Wiley. ISBN 0471548979, p159
 ^ Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press. p. 97. ISBN 0521835402.
 ^ NIST/SEMATECH, '6.3.3.1. Counts Control Charts', eHandbook of Statistical Methods, accessed 25 October 2006
 ^ Huiming, Zhang; Yunxiao Liu; Bo Li (2014). "Notes on discrete compound Poisson model with applications to risk theory". Insurance: Mathematics and Economics 59: 325–336. doi:10.1016/j.insmatheco.2014.09.012.
 ^ McCullagh, Peter; Nelder, John (1989). Generalized Linear Models. London: Chapman and Hall. ISBN 0412317605. page 196 gives the approximation and higher order terms.
 ^ ^{a} ^{b} Johnson, N.L., Kotz, S., Kemp, A.W. (1993) Univariate Discrete distributions (2nd edition). Wiley. ISBN 0471548979, p163
 ^ S. M. Ross (2007). Introduction to Probability Models (ninth ed.). Boston: Academic Press. ISBN 9780125980623. pp. 307–308.
 ^ ^{a} ^{b} Johnson, N.L., Kotz, S., Kemp, A.W. (1993) Univariate Discrete distributions (2nd edition). Wiley. ISBN 0471548979, p171
 ^ Johnson, N.L., Kotz, S., Kemp, A.W. (1993) Univariate Discrete distributions (2nd edition). Wiley. ISBN 0471548979, p153
 ^ "The Poisson Process as a Model for a Diversity of Behavioural Phenomena"
 ^ Philip J. Boland. "A Biographical Glimpse of William Sealy Gosset". The American Statistician, Vol. 38, No. 3. (Aug., 1984), pp. 179–183. Retrieved 20150306.
 ^
Dave Hornby. "Football Prediction Model: Poisson Distribution".
calculate the probability of outcomes for a football match, which in turn can be turned into odds which we can use to identify value in the market..
 ^
Aatish Bhatia. "What does randomness look like?".
Within a large area of London, the bombs weren’t being targeted. They rained down at random in a devastating, citywide game of Russian roulette.
 ^ P.X., Gallagher (1976). "On the distribution of primes in short intervals". Mathematika 23: 4–9. doi:10.1112/s0025579300016442.
 ^ A. Colin Cameron, Pravin K. Trivedi (1998). Regression Analysis of Count Data. Retrieved 20130130.
(p.5) The law of rare events states that the total number of events will follow, approximately, the Poisson distribution if an event may occur in any of a large number of trials but the probability of occurrence in any given trial is small.
 ^ Edgeworth, F. Y. (1913). "On the use of the theory of probabilities in statistics relating to society". Journal of the Royal Statistical Society 76: 165–193.
 ^ ^{a} ^{b} Devroye, Luc (1986). "Discrete Univariate Distributions" (PDF). NonUniform Random Variate Generation. New York: SpringerVerlag. p. 505.
 ^ Paszek, Ewa. "Maximum Likelihood Estimation – Examples".
 ^ Garwood, F. (1936). "Fiducial Limits for the Poisson Distribution". Biometrika 28 (3/4): 437–442. doi:10.1093/biomet/28.34.437.
 ^ Breslow, NE; Day, NE (1987). Statistical Methods in Cancer Research: Volume 2—The Design and Analysis of Cohort Studies. Paris: International Agency for Research on Cancer. ISBN 9789283201823.
 ^ Fink, Daniel (1997). A Compendium of Conjugate Priors.
 ^ Gelman et al. (2005). Bayesian Data Analysis (2nd ed.). p. 60.
 ^ Clevenson, M. L.; Zidek, J. V. (1975). "Simultaneous Estimation of the Means of Independent Poisson Laws". Journal of the American Statistical Association 70 (351a): 698–705. doi:10.1080/01621459.1975.10482497.
 ^ Berger, J. O. (1985). Statistical Decision Theory and Bayesian Analysis (2nd ed.). Springer.
 ^ Loukas, S.; Kemp, C. D. (1986). "The Index of Dispersion Test for the Bivariate Poisson Distribution". Biometrics 42 (4): 941–948.
References
 Joachim H. Ahrens, Ulrich Dieter (1974). "Computer Methods for Sampling from Gamma, Beta, Poisson and Binomial Distributions". Computing 12 (3): 223–246. doi:10.1007/BF02293108.
 Joachim H. Ahrens, Ulrich Dieter (1982). "Computer Generation of Poisson Deviates". ACM Transactions on Mathematical Software 8 (2): 163–179. doi:10.1145/355993.355997.
 Ronald J. Evans, J. Boersma, N. M. Blachman, A. A. Jagers (1988). "The Entropy of a Poisson Distribution: Problem 876". SIAM Review 30 (2): 314–317. doi:10.1137/1030059.
 Donald E. Knuth (1969). Seminumerical Algorithms. The Art of Computer Programming, Volume 2. Addison Wesley.

Lua error in Module:Authority_control at line 346: attempt to index field 'wikibase' (a nil value).