Negative binomial distribution
Different texts adopt slightly different definitions for the negative binomial distribution. They can be distinguished by whether the support starts at k = 0 or at k = r, whether p denotes the probability of a success or of a failure, and whether r represents success or failure,^{[1]} so it is crucial to identify the specific parametrization used in any given text.  
Probability mass function
The orange line represents the mean, which is equal to 10 in each of these plots; the green line shows the standard deviation. 

Notation  \mathrm{NB}(r,\,p) 

Parameters 
r > 0 — number of failures until the experiment is stopped (integer, but the definition can also be extended to reals) p ∈ (0,1) — success probability in each experiment (real) 
Support  k ∈ { 0, 1, 2, 3, … } — number of successes 
pmf  {k+r1 \choose k}\cdot (1p)^r p^k,\!involving a binomial coefficient 
CDF  1I_p(k+1,\,r), the regularized incomplete beta function 
Mean  \frac{pr}{1p} 
Mode  \begin{cases}\big\lfloor\frac{p(r1)}{1p}\big\rfloor & \text{if}\ r>1 \\ 0 & \text{if}\ r\leq 1\end{cases} 
Variance  \frac{pr}{(1p)^2} 
Skewness  \frac{1+p}{\sqrt{pr}} 
Ex. kurtosis  \frac{6}{r} + \frac{(1p)^2}{pr} 
MGF  \biggl(\frac{1p}{1  p e^t}\biggr)^{\!r} \text{ for }t<\log p 
CF  \biggl(\frac{1p}{1  p e^{i\,t}}\biggr)^{\!r} \text{ with }t\in\mathbb{R} 
PGF  \biggl(\frac{1p}{1  pz}\biggr)^{\!r} \text{ for }z<\frac1p 
Fisher information  \frac{r}{p^2(1p)} 
In probability theory and statistics, the negative binomial distribution is a discrete probability distribution of the number of successes in a sequence of independent and identically distributed Bernoulli trials before a specified (nonrandom) number of failures (denoted r) occurs. For example, if we define a "1" as failure, all non"1"s as successes, and we throw a die repeatedly until the third time “1” appears (r = three failures), then the probability distribution of the number of non“1”s that had appeared will be a negative binomial.
The Pascal distribution (after Poisson distribution by allowing the mean and variance to be different, unlike the Poisson. “Contagious” events have positively correlated occurrences causing a larger variance than if the occurrences were independent, due to a positive covariance term.
Contents
Definition
Suppose there is a sequence of independent Bernoulli trials, each trial having two potential outcomes called “success” and “failure”. In each trial the probability of success is p and of failure is (1 − p). We are observing this sequence until a predefined number r of failures has occurred. Then the random number of successes we have seen, X, will have the negative binomial (or Pascal) distribution:
 X\ \sim\ \text{NB}(r; p)
When applied to realworld problems, outcomes of success and failure may or may not be outcomes we ordinarily view as good and bad, respectively. Suppose we used the negative binomial distribution to model the number of days a certain machine works before it breaks down. In this case “success” would be the result on a day when the machine worked properly, whereas a breakdown would be a “failure”. If we used the negative binomial distribution to model the number of goal attempts a sportsman makes before scoring a goal, though, then each unsuccessful attempt would be a “success”, and scoring a goal would be “failure”. If we are tossing a coin, then the negative binomial distribution can give the number of heads (“success”) we are likely to encounter before we encounter a certain number of tails (“failure”). In the probability mass function below, p is the probability of success, and (1p) is the probability of failure.
The probability mass function of the negative binomial distribution is
 f(k; r, p) \equiv \Pr(X = k) = {k+r1 \choose k} p^k(1p)^r \quad\text{for }k = 0, 1, 2, \dots
Here the quantity in parentheses is the binomial coefficient, and is equal to
 {k+r1 \choose k} = \frac{(k+r1)!}{k!\,(r1)!} = \frac{(k+r1)(k+r2)\cdots(r)}{k!}.
This quantity can alternatively be written in the following manner, explaining the name “negative binomial”:
 \frac{(k+r1)\cdots(r)}{k!} = (1)^k \frac{(r)(r1)(r2)\cdots(rk+1)}{k!} = (1)^k{r \choose k}. \qquad (*)
To understand the above definition of the probability mass function, note that the probability for every specific sequence of k successes and r failures is (1 − p)^{r}p^{k}, because the outcomes of the k + r trials are supposed to happen independently. Since the rth failure comes last, it remains to choose the k trials with successes out of the remaining k + r − 1 trials. The above binomial coefficient, due to its combinatorial interpretation, gives precisely the number of all these sequences of length k + r − 1.
 \left\{(k+1) \Pr (k+1)p \Pr (k) (k+r)=0,\Pr (0)=(1p)^r\right\}
Expectation
The expected total number of trials k+r of a negative binomial distribution with parameters (r,p) is r/(1p). To see this intuitively, imagine the above experiment is performed many times. That is, a set of trials are performed until r failures are obtained,then another set of trials, and then another etc. Write down the number of trials performed in each experiment: a, b, c... and set a + b + c + ... = N. Now we would expect about N(1p) failures in total. Say the experiment was performed n times. Then there are nr failures in total. So we would expect nr = N(1p), so N/n = r/(1p). See that N/n is just the average number of trials per experiment. That is what we mean by "expectation." The average number of successes per experiment is N/n  r, which must have expected value equal to r/(1p)  r = rp/(1p). This agrees with the Mean given in the box on the righthand side of this page.
Extension to realvalued r
It is possible to extend the definition of the negative binomial distribution to the case of a positive real parameter r. Although it is impossible to visualize a noninteger number of “failures”, we can still formally define the distribution through its probability mass function.
As before, we say that X has a negative binomial (or Pólya) distribution if it has a probability mass function:
 f(k; r, p) \equiv \Pr(X = k) = {k+r1 \choose k} p^k (1p)^r \quad\text{for }k = 0, 1, 2, \dots
Here r is a real, positive number. The binomial coefficient is then defined by the multiplicative formula and can also be rewritten using the gamma function:
 {k+r1 \choose k} = \frac{(k+r1)(k+r2)\cdots(r)}{k!} = \frac{\Gamma(k+r)}{k!\,\Gamma(r)}.
Note that by the binomial series and (*) above, for every 0 ≤ p < 1,
 (1p)^{r}=\sum_{k=0}^\infty{r \choose k}(p)^k =\sum_{k=0}^\infty{k+r1\choose k}p^k,
hence the terms of the probability mass function indeed add up to one.
Alternative formulations
Some textbooks may define the negative binomial distribution slightly differently from here. The most common variations are:

The definition where X is the total number of trials needed to get r failures, not simply the number of successes. Since the total number of trials is equal to the number of successes plus the number of failures, this definition differs from ours by adding constant r. In order to convert formulas written with this definition into the one used in the article, replace everywhere “k” with “k  r”, and also subtract r from the mean, the median, and the mode. In order to convert formulas of this article into this alternative definition, replace “k” with “k + r” and add r to the mean, the median and the mode. Effectively, this implies using the probability mass function
 f(k; r, p) \equiv \Pr(X = k) = {k1 \choose kr} (1p)^r p^{kr} \quad\text{for }k = r, r+1, r+2, \dots,
which perhaps resembles the binomial distribution more closely than the version above. Note that the arguments of the binomial coefficient are decremented due to order: the last "failure" must occur last, and so the other events have one fewer positions available when counting possible orderings.
Note that this definition of the negative binomial distribution does not easily generalize to a positive, real parameter r.  The definition where p denotes the probability of a failure, not of a success. In order to convert formulas between this definition and the one used in the article, replace “p” with “1 − p” everywhere.
 The definition where the support X is defined as the number of failures, rather than the number of successes. This definition — where X counts failures but p is the probability of success — has exactly the same formulas as in the previous case where X counts successes but p is the probability of failure. However, the corresponding text will have the words “failure” and “success” swapped compared with the previous case.
 The two alterations above may be applied simultaneously, i.e. X counts total trials, and p is the probability of failure.

In negative binomial regression,^{[2]} the distribution is specified in terms of its mean, m, which is then related to explanatory variables as in linear regression or other generalized linear models. The probability mass function then becomes
 \Pr(X = k) = \left(\frac{r}{r+m}\right)^r \frac{\Gamma(r+k)}{k! \, \Gamma(r)} \left(\frac{m}{r+m}\right)^k \quad\text{for }k = 0, 1, 2, \dots.
Occurrence
Waiting time in a Bernoulli process
For the special case where r is an integer, the negative binomial distribution is known as the Pascal distribution. It is the probability distribution of a certain number of failures and successes in a series of independent and identically distributed Bernoulli trials. For k + r Bernoulli trials with success probability p, the negative binomial gives the probability of k successes and r failures, with a failure on the last trial. In other words, the negative binomial distribution is the probability distribution of the number of successes before the rth failure in a Bernoulli process, with probability p of successes on each trial. A Bernoulli process is a discrete time process, and so the number of trials, failures, and successes are integers.
Consider the following example. Suppose we repeatedly throw a die, and consider a “1” to be a “failure”. The probability of failure on each trial is 1/6. The number of successes before the third failure belongs to the infinite set { 0, 1, 2, 3, ... }. That number of successes is a negativebinomially distributed random variable.
When r = 1 we get the probability distribution of number of successes before the first failure (i.e. the probability of the first failure occurring on the (k + 1)st trial), which is a geometric distribution:
 f(k; r, p) = (1p) \cdot p^k \!
Overdispersed Poisson
The negative binomial distribution, especially in its alternative parameterization described above, can be used as an alternative to the Poisson distribution. It is especially useful for discrete data over an unbounded positive range whose sample variance exceeds the sample mean. In such cases, the observations are overdispersed with respect to a Poisson distribution, for which the mean is equal to the variance. Hence a Poisson distribution is not an appropriate model. Since the negative binomial distribution has one more parameter than the Poisson, the second parameter can be used to adjust the variance independently of the mean. See Cumulants of some discrete probability distributions.
An application of this is to annual counts of tropical cyclones in the North Atlantic or to monthly to 6monthly counts of wintertime extratropical cyclones over Europe, for which the variance is greater than the mean.^{[5]}^{[6]}^{[7]} In the case of modest overdispersion, this may produce substantially similar results to an overdispersed Poisson distribution.^{[8]}^{[9]}
The negative binomial distribution is also commonly used to model gene expression in the form of discrete read count data from highthroughput RNA sequencing experiments. ^{[10]}^{[11]}
Related distributions
 The geometric distribution (on { 0, 1, 2, 3, ... }) is a special case of the negative binomial distribution, with

 \text{Geom}(p) = \text{NB}(1,\, 1p).\,
 The negative binomial distribution is a special case of the discrete phasetype distribution.
 The negative binomial distribution is a special case of discrete Compound Poisson distribution.
Poisson distribution
Consider a sequence of negative binomial distributions where the stopping parameter r goes to infinity, whereas the probability of success in each trial, p, goes to zero in such a way as to keep the mean of the distribution constant. Denoting this mean λ, the parameter p will be p=λ/(λ+r)
 \lambda = r\,\frac{p}{1p} \quad \Rightarrow \quad p = \frac{\lambda}{r+\lambda}.
Under this parametrization the probability mass function will be
 f(k; r, p) = \frac{\Gamma(k+r)}{k!\cdot\Gamma(r)}p^k(1p)^r = \frac{\lambda^k}{k!} \cdot \frac{\Gamma(r+k)}{\Gamma(r)\;(r+\lambda)^k} \cdot \frac{1}{\left(1+\frac{\lambda}{r}\right)^{r}}
Now if we consider the limit as r → ∞, the second factor will converge to one, and the third to the exponent function:
 \lim_{r\to\infty} f(k; r, p) = \frac{\lambda^k}{k!} \cdot 1 \cdot \frac{1}{e^\lambda},
which is the mass function of a Poissondistributed random variable with expected value λ.
In other words, the alternatively parameterized negative binomial distribution converges to the Poisson distribution and r controls the deviation from the Poisson. This makes the negative binomial distribution suitable as a robust alternative to the Poisson, which approaches the Poisson for large r, but which has larger variance than the Poisson for small r.
 \text{Poisson}(\lambda) = \lim_{r \to \infty} \text{NB}\Big(r,\ \frac{\lambda}{\lambda+r}\Big).
Gamma–Poisson mixture
The negative binomial distribution also arises as a continuous mixture of Poisson distributions (i.e. a compound probability distribution) where the mixing distribution of the Poisson rate is a gamma distribution. That is, we can view the negative binomial as a Poisson(λ) distribution, where λ is itself a random variable, distributed as a gamma distribution with shape = r and scale θ = p/(1 − p) or correspondingly rate β = (1  p)/p.
Formally, this means that the mass function of the negative binomial distribution can be written as
 \begin{align} f(k; r, p) & = \int_0^\infty f_{\text{Poisson}(\lambda)}(k) \cdot f_{\text{Gamma}\left(r,\, \frac{1p}{p}\right)}(\lambda) \; \mathrm{d}\lambda \\[8pt] & = \int_0^\infty \frac{\lambda^k}{k!} e^{\lambda} \cdot \lambda^{r1}\frac{e^{\lambda (1p)/p}}{\big(\frac{p}{1p}\big)^r\,\Gamma(r)} \; \mathrm{d}\lambda \\[8pt] & = \frac{(1p)^r p^{r}}{k!\,\Gamma(r)} \int_0^\infty \lambda^{r+k1} e^{\lambda/p} \;\mathrm{d}\lambda \\[8pt] & = \frac{(1p)^r p^{r}}{k!\,\Gamma(r)} \ p^{r+k} \, \Gamma(r+k) \\[8pt] & = \frac{\Gamma(r+k)}{k!\;\Gamma(r)} \; p^k (1p)^r. \end{align}
Because of this, the negative binomial distribution is also known as the gamma–Poisson (mixture) distribution.
Note: The negative binomial distribution was originally derived as a limiting case of the gammaPoisson distribution.^{[12]}
Sum of geometric distributions
If Y_{r} is a random variable following the negative binomial distribution with parameters r and p, and support {0, 1, 2, ...}, then Y_{r} is a sum of r independent variables following the geometric distribution (on {0, 1, 2, ...}) with parameter 1p. As a result of the central limit theorem, Y_{r} (properly scaled and shifted) is therefore approximately normal for sufficiently large r.
Furthermore, if B_{s+r} is a random variable following the binomial distribution with parameters s + r and 1 − p, then
 \begin{align} \Pr(Y_r \leq s) & {} = 1  I_p(s+1, r) \\ & {} = 1  I_{p}((s+r)(r1), (r1)+1) \\ & {} = 1  \Pr(B_{s+r} \leq r1) \\ & {} = \Pr(B_{s+r} \geq r) \\ & {} = \Pr(\text{after } s+r \text{ trials, there are at least } r \text{ successes}). \end{align}
In this sense, the negative binomial distribution is the "inverse" of the binomial distribution.
The sum of independent negativebinomially distributed random variables r_{1} and r_{2} with the same value for parameter p is negativebinomially distributed with the same p but with "rvalue" r_{1} + r_{2}.
The negative binomial distribution is infinitely divisible, i.e., if Y has a negative binomial distribution, then for any positive integer n, there exist independent identically distributed random variables Y_{1}, ..., Y_{n} whose sum has the same distribution that Y has.
Representation as compound Poisson distribution
The negative binomial distribution NB(r,p) can be represented as a compound Poisson distribution: Let {Y_{n}, n ∈ ℕ_{0}} denote a sequence of independent and identically distributed random variables, each one having the logarithmic distribution Log(p), with probability mass function
 f(k; r, p) = \frac{p^k}{k\ln(1p)},\qquad k\in{\mathbb N}.
Let N be a random variable, independent of the sequence, and suppose that N has a Poisson distribution with mean λ = −r ln(1 − p). Then the random sum
 X=\sum_{n=1}^N Y_n
is NB(r,p)distributed. To prove this, we calculate the probability generating function G_{X} of X, which is the composition of the probability generating functions G_{N} and G_{Y1}. Using
 G_N(z)=\exp(\lambda(z1)),\qquad z\in\mathbb{R},
and
 G_{Y_1}(z)=\frac{\ln(1pz)}{\ln(1p)},\qquad z<\frac1p,
we obtain
 \begin{align}G_X(z) &=G_N(G_{Y_1}(z))\\ &=\exp\biggl(\lambda\biggl(\frac{\ln(1pz)}{\ln(1p)}1\biggr)\biggr)\\ &=\exp\bigl(r(\ln(1pz)\ln(1p))\bigr)\\ &=\biggl(\frac{1p}{1pz}\biggr)^r,\qquad z<\frac1p,\end{align}
which is the probability generating function of the NB(r,p) distribution.
Properties
Cumulative distribution function
The cumulative distribution function can be expressed in terms of the regularized incomplete beta function:
 f(k; r, p) \equiv \Pr(X\le k) = 1  I_{p}(k+1, r) = I_{1p}(r,k+1).
Sampling and point estimation of p
Suppose p is unknown and an experiment is conducted where it is decided ahead of time that sampling will continue until r successes are found. A sufficient statistic for the experiment is k, the number of failures.
In estimating p, the minimum variance unbiased estimator is
 \hat{p}=\frac{r1}{r+k1}.
The maximum likelihood estimate of p is
 \tilde{p}=\frac{r}{r+k},
but this is a biased estimate. Its inverse (r + k)/r, is an unbiased estimate of 1/p, however.^{[13]}
Relation to the binomial theorem
Suppose Y is a random variable with a binomial distribution with parameters n and p. Assume p + q = 1, with p, q >=0. Then the binomial theorem implies that
 1=1^n=(p+q)^n=\sum_{k=0}^n {n \choose k} p^k q^{nk}.
Using Newton's binomial theorem, this can equally be written as:
 (p+q)^n=\sum_{k=0}^\infty {n \choose k} p^k q^{nk},
in which the upper bound of summation is infinite. In this case, the binomial coefficient
 {n \choose k}={n(n1)(n2)\cdots(nk+1) \over k! }.
is defined when n is a real number, instead of just a positive integer. But in our case of the binomial distribution it is zero when k > n. We can then say, for example
 (p+q)^{8.3}=\sum_{k=0}^\infty {8.3 \choose k} p^k q^{8.3  k}.
Now suppose r > 0 and we use a negative exponent:
 1=p^r\cdot p^{r}=p^r (1q)^{r}=p^r \sum_{k=0}^\infty {r \choose k} (q)^k.
Then all of the terms are positive, and the term
 p^r {r \choose k} (q)^k
is just the probability that the number of failures before the rth success is equal to k, provided r is an integer. (If r is a negative noninteger, so that the exponent is a positive noninteger, then some of the terms in the sum above are negative, so we do not have a probability distribution on the set of all nonnegative integers.)
Now we also allow noninteger values of r. Then we have a proper negative binomial distribution, which is a generalization of the Pascal distribution, which coincides with the Pascal distribution when r happens to be a positive integer.
Recall from above that
 The sum of independent negativebinomially distributed random variables r_{1} and r_{2} with the same value for parameter p is negativebinomially distributed with the same p but with "rvalue" r_{1} + r_{2}.
This property persists when the definition is thus generalized, and affords a quick way to see that the negative binomial distribution is infinitely divisible.
Parameter estimation
Maximum likelihood estimation
The likelihood function for N iid observations (k_{1}, ..., k_{N}) is
 L(r,p)=\prod_{i=1}^N f(k_i;r,p)\,\!
from which we calculate the loglikelihood function
 \ell(r,p) = \sum_{i=1}^N \ln{(\Gamma(k_i + r))}  \sum_{i=1}^N \ln(k_i !)  N\ln{(\Gamma(r))} + \sum_{i=1}^N k_i \ln{(p)} + Nr \ln(1p).
To find the maximum we take the partial derivatives with respect to r and p and set them equal to zero:
 \frac{\partial \ell(r,p)}{\partial p} = \sum_{i=1}^N k_i \frac{1}{p}  Nr \frac{1}{1p} = 0 and
 \frac{\partial \ell(r,p)}{\partial r} =\sum_{i=1}^N \psi(k_i + r)  N\psi(r) + N\ln{(1p)} =0
where
 \psi(k) = \frac{\Gamma'(k)}{\Gamma(k)} \! is the digamma function.
Solving the first equation for p gives:
 p = \frac{\sum_{i=1}^N k_i} {N r + \sum_{i=1}^N k_i }
Substituting this in the second equation gives:
 \frac{\partial \ell(r,p)}{\partial r} = \sum_{i=1}^N \psi(k_i + r)  N\psi(r) + N\ln{\left(\frac{r}{r + \sum_{i=1}^N k_i/N}\right)} =0
This equation cannot be solved for r in closed form. If a numerical solution is desired, an iterative technique such as Newton's method can be used.
Examples
Selling candy
Pat is required to sell candy bars to raise money for the 6th grade field trip. There are thirty houses in the neighborhood, and Pat is not supposed to return home until five candy bars have been sold. So the child goes door to door, selling candy bars. At each house, there is a 0.4 probability of selling one candy bar and a 0.6 probability of selling nothing.
What's the probability of selling the last candy bar at the nth house?
Recall that the NegBin(r, p) distribution describes the probability of k failures and r successes in k + r Bernoulli(p) trials with success on the last trial. Selling five candy bars means getting five successes. The number of trials (i.e. houses) this takes is therefore k + 5 = n. The random variable we are interested in is the number of houses, so we substitute k = n − 5 into a NegBin(5, 0.4) mass function and obtain the following mass function of the distribution of houses (for n ≥ 5):
 f(n) = {(n5) + 5  1 \choose n5} \; 0.4^5 \; 0.6^{n5} = {n1 \choose n5} \; 2^5 \; \frac{3^{n5}}{5^n}.
What's the probability that Pat finishes on the tenth house?
 f(10) = 0.1003290624. \,
What's the probability that Pat finishes on or before reaching the eighth house?
To finish on or before the eighth house, Pat must finish at the fifth, sixth, seventh, or eighth house. Sum those probabilities:
 f(5) = 0.01024 \,
 f(6) = 0.03072 \,
 f(7) = 0.055296 \,
 f(8) = 0.0774144 \,
 \sum_{j=5}^8 f(j) = 0.17367.
What's the probability that Pat exhausts all 30 houses in the neighborhood?
This can be expressed as the probability that Pat does not finish on the fifth through the thirtieth house:
 1\sum_{j=5}^{30} f(j) = 1  I_{0.4}(5, 305+1) \approx 1  0.99849 = 0.00151.
Length of hospital stay
Hospital length of stay is an example of real world data that can be modelled well with a negative binomial distribution.^{[14]}
See also
 Coupon collector's problem
 Beta negative binomial distribution
 Extended negative binomial distribution
 Negative multinomial distribution
 Binomial distribution
 Poisson distribution
 Exponential family
 Compound Poisson distribution
References
 ^
 ^ ^{}a ^{b} Hilbe, Joseph M. (2011), "Negative Binomial Regression, second edition", Cambridge, UK: Cambridge University Press
 ^ LloydSmith, J.O. (2007), "Maximum Likelihood Estimation of the Negative Binomial Dispersion Parameter for Highly Overdispersed Data, with Applications to Infectious Diseases". PLoS ONE 2(2): e180. doi:10.1371/journal.pone.0000180
 ^ Crawley, Michael J. (2012), "The R Book", Wiley
 ^ Villarini, G.; Vecchi, G.A. and Smith, J.A. (2010). "Modeling of the dependence of tropical storm counts in the North Atlantic Basin on climate indices".
 ^ Mailier, P.J.; Stephenson, D.B.; Ferro, C.A.T.; Hodges, K.I. (2006). "Serial Clustering of Extratropical Cyclones".
 ^ Vitolo, R.; Stephenson, D.B.; Cook, Ian M.; MitchellWallace, K. (2009). "Serial clustering of intense European storms".
 ^
 ^ Cameron, Adrian C.; Trivedi, Pravin K. (1998). Regression analysis of count data. Cambridge University Press.
 ^ Love, Michael; Anders, Simon (October 14, 2014). "Differential analysis of count data – the DESeq2 package". http://www.bioconductor.org. Retrieved October 14, 2014.
 ^ Chen, Yunshun; Davis, McCarthy (September 25, 2014). "edgeR: differential expression analysis of digital gene expression data". http://www.bioconductor.org. Retrieved October 14, 2014.
 ^ Greenwood M, Yule GU (1920) An enquiry into the nature of frequency distributions representative of multiple happenings with particular reference of multiple attacks of disease or of repeated accidents. J R Statist Soc 83: 25–279
 ^ J. B. S. Haldane, "On a Method of Estimating Frequencies", Biometrika, Vol. 33, No. 3 (Nov., 1945), pp. 222–225. JSTOR 2332299
 ^ Carter, E.M., Potts, H.W.W. (4 April 2014). "Predicting length of stay from an electronic patient record system: a primary total knee replacement example". BMC Medical Informatics & Decision Making 14: 26.
