Different texts (and even different parts of this article) 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 identifying the specific parametrization used is crucial 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	${\displaystyle \mathrm {NB} (r,\,p)}$
Parameters	r > 0 — number of successes 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 failures
PMF	${\displaystyle k\mapsto {k+r-1 \choose k}\cdot (1-p)^{k}p^{r},}$ involving a binomial coefficient
CDF	${\displaystyle k\mapsto I_{p}(r,\,k+1),}$ the regularized incomplete beta function
Mean	${\displaystyle {\frac {r(1-p)}{p))}$
Mode	${\displaystyle {\begin{cases}\left\lfloor {\frac {(r-1)(1-p)}{p))\right\rfloor &{\text{if ))r>1\\0&{\text{if ))r\leq 1\end{cases))}$
Variance	${\displaystyle {\frac {r(1-p)}{p^{2))))$
Skewness	${\displaystyle {\frac {2-p}{\sqrt {(1-p)r))))$
Excess kurtosis	${\displaystyle {\frac {6}{r))+{\frac {p^{2)){(1-p)r))}$
MGF	${\displaystyle {\biggl (}{\frac {p}{1-(1-p)e^{t))}{\biggr )}^{\!r}{\text{ for ))t<-\log(1-p)}$
CF	${\displaystyle {\biggl (}{\frac {p}{1-(1-p)e^{i\,t))}{\biggr )}^{\!r}{\text{ with ))t\in \mathbb {R} }$
PGF	${\displaystyle {\biggl (}{\frac {p}{1-(1-p)z)){\biggr )}^{\!r}{\text{ for ))|z|<{\frac {1}{p))}$
Fisher information	${\displaystyle {\frac {r}{p^{2}(1-p)))}$
Method of Moments	${\displaystyle r={\frac {E[X]^{2)){V[X]-E[X]))}$ ${\displaystyle p={\frac {E[X]}{V[X]))}$

In probability theory and statistics, the negative binomial distribution is a discrete probability distribution that models the number of failures in a sequence of independent and identically distributed Bernoulli trials before a specified (non-random) number of successes (denoted ${\displaystyle r}$) occurs.^[2] For example, we can define rolling a 6 on some dice as a success, and rolling any other number as a failure, and ask how many failure rolls will occur before we see the third success (${\displaystyle r=3}$). In such a case, the probability distribution of the number of failures that appear will be a negative binomial distribution.

An alternative formulation is to model the number of total trials (instead of the number of failures). In fact, for a specified (non-random) number of successes (r), the number of failures (n − r) are random because the total trials (n) are random. For example, we could use the negative binomial distribution to model the number of days n (random) a certain machine works (specified by r) before it breaks down.

The Pascal distribution (after Blaise Pascal) and Polya distribution (for George Pólya) are special cases of the negative binomial distribution. A convention among engineers, climatologists, and others is to use "negative binomial" or "Pascal" for the case of an integer-valued stopping-time parameter (${\displaystyle r}$) and use "Polya" for the real-valued case.

For occurrences of associated discrete events, like tornado outbreaks, the Polya distributions can be used to give more accurate models than the Poisson distribution by allowing the mean and variance to be different, unlike the Poisson. The negative binomial distribution has a variance ${\displaystyle \mu /p}$, with the distribution becoming identical to Poisson in the limit ${\displaystyle p\to 1}$ for a given mean ${\displaystyle \mu }$ (i.e. when the failures are increasingly rare). This can make the distribution a useful overdispersed alternative to the Poisson distribution, for example for a robust modification of Poisson regression. In epidemiology, it has been used to model disease transmission for infectious diseases where the likely number of onward infections may vary considerably from individual to individual and from setting to setting.^[3] More generally, it may be appropriate where events have positively correlated occurrences causing a larger variance than if the occurrences were independent, due to a positive covariance term.

The term "negative binomial" is likely due to the fact that a certain binomial coefficient that appears in the formula for the probability mass function of the distribution can be written more simply with negative numbers.^[4]

Definitions

Imagine a sequence of independent Bernoulli trials: each trial has two potential outcomes called "success" and "failure." In each trial the probability of success is ${\displaystyle p}$ and of failure is ${\displaystyle 1-p}$. We observe this sequence until a predefined number ${\displaystyle r}$ of successes occurs. Then the random number of observed failures, ${\displaystyle X}$, follows the negative binomial (or Pascal) distribution:

${\displaystyle X\sim \operatorname {NB} (r,p)}$

Probability mass function

The probability mass function of the negative binomial distribution is

${\displaystyle f(k;r,p)\equiv \Pr(X=k)={\binom {k+r-1}{k))(1-p)^{k}p^{r))$

where r is the number of successes, k is the number of failures, and p is the probability of success on each trial.

Here, the quantity in parentheses is the binomial coefficient, and is equal to

${\displaystyle {\binom {k+r-1}{k))={\frac {(k+r-1)!}{(r-1)!\,(k)!))={\frac {(k+r-1)(k+r-2)\dotsm (r)}{k!)).}$

There are k failures chosen from k + r − 1 trials rather than k + r because the last of the k + r trials is by definition a success.

This quantity can alternatively be written in the following manner, explaining the name "negative binomial":

${\displaystyle {\begin{aligned}&{\frac {(k+r-1)\dotsm (r)}{k!))\\[10pt]={}&(-1)^{k}{\frac {\overbrace {(-r)(-r-1)(-r-2)\dotsm (-r-k+1)} ^{k{\text{ factors)))){k!))=(-1)^{k}{\binom {-r}((\phantom {-))k)).\end{aligned))}$

Note that by the last expression and the binomial series, for every 0 ≤ p < 1 and ${\displaystyle q=1-p}$,

${\displaystyle p^{-r}=(1-q)^{-r}=\sum _{k=0}^{\infty }{\binom {-r}((\phantom {-))k))(-q)^{k}=\sum _{k=0}^{\infty }{\binom {k+r-1}{k))q^{k))$

hence the terms of the probability mass function indeed add up to one as below.

${\displaystyle \sum _{k=0}^{\infty }{\binom {k+r-1}{k))(1-p)^{k}p^{r}=p^{-r}p^{r}=1}$

To understand the above definition of the probability mass function, note that the probability for every specific sequence of r successes and k failures is p^r(1 − p)^k, because the outcomes of the k + r trials are supposed to happen independently. Since the rth success always comes last, it remains to choose the k trials with failures 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.

Cumulative distribution function

The cumulative distribution function can be expressed in terms of the regularized incomplete beta function:^[2][5]

${\displaystyle F(k;r,p)\equiv \Pr(X\leq k)=I_{p}(r,k+1).}$

(This formula is using the same parameterization as in the article's table, with r the number of successes, and ${\displaystyle p=r/(r+\mu )}$ with ${\displaystyle \mu }$ the mean.)

It can also be expressed in terms of the cumulative distribution function of the binomial distribution:^[6]

${\displaystyle F(k;r,p)=F_{\text{binomial))(k;n=k+r,1-p).}$

Alternative formulations

Some sources may define the negative binomial distribution slightly differently from the primary one here. The most common variations are where the random variable X is counting different things. These variations can be seen in the table here:

	X is counting...	Probability mass function	Formula	Alternate formula (using equivalent binomial)	Alternate formula (simplified using: ${\textstyle n=k+r}$)	Support
1	k failures, given r successes	${\textstyle f(k;r,p)\equiv \Pr(X=k)=}$	${\textstyle {\binom {k+r-1}{k))p^{r}(1-p)^{k))$[7][5][8]	${\textstyle {\binom {k+r-1}{r-1))p^{r}(1-p)^{k))$[2] [9][10][11]	${\textstyle {\binom {n-1}{k))p^{r}(1-p)^{k))$	${\displaystyle {\text{for ))k=0,1,2,\ldots }$
2	n trials, given r successes	${\textstyle f(n;r,p)\equiv \Pr(X=n)=}$	${\textstyle {\binom {n-1}{r-1))p^{r}(1-p)^{n-r))$[5][11][12][13][14]	${\textstyle {\binom {n-1}{n-r))p^{r}(1-p)^{n-r))$		${\displaystyle {\text{for ))n=r,r+1,r+2,\dotsc }$
3	n trials, given r failures	${\textstyle f(n;r,p)\equiv \Pr(X=n)=}$	${\textstyle {\binom {n-1}{r-1))p^{n-r}(1-p)^{r))$	${\textstyle {\binom {n-1}{n-r))p^{n-r}(1-p)^{r))$	${\textstyle {\binom {n-1}{k))p^{k}(1-p)^{r))$
4	k successes, given r failures	${\textstyle f(k;r,p)\equiv \Pr(X=k)=}$	${\textstyle {\binom {k+r-1}{k))p^{k}(1-p)^{r))$	${\textstyle {\binom {k+r-1}{r-1))p^{k}(1-p)^{r))$		${\displaystyle {\text{for ))k=0,1,2,\ldots }$
-	k successes, given n trials	${\textstyle f(k;n,p)\equiv \Pr(X=k)=}$	This is the binomial distribution not the negative binomial: ${\textstyle {\binom {n}{k))p^{k}(1-p)^{n-k))$			${\displaystyle {\text{for ))k=0,1,2,\dotsc ,n}$

Each of the four definitions of the negative binomial distribution can be expressed in slightly different but equivalent ways. The first alternative formulation is simply an equivalent form of the binomial coefficient, that is: ${\textstyle {\binom {a}{b))={\binom {a}{a-b))\quad {\text{for ))\ 0\leq b\leq a}$. The second alternate formulation somewhat simplifies the expression by recognizing that the total number of trials is simply the number of successes and failures, that is: ${\textstyle n=r+k}$. These second formulations may be more intuitive to understand, however they are perhaps less practical as they have more terms.

• The definition where X is the number of n trials that occur for a given number of r successes is similar to the primary definition, except that the number of trials is given instead of the number of failures. This adds r to the value of the random variable, shifting its support and mean.
• The definition where X is the number of k successes (or n trials) that occur for a given number of r failures is similar to the primary definition used in this article, except that numbers of failures and successes are switched when considering what is being counted and what is given. Note however, that p still refers to the probability of "success".
• The definition of the negative binomial distribution can be extended to the case where the parameter r can take on a positive real value. Although it is impossible to visualize a non-integer number of "failures", we can still formally define the distribution through its probability mass function. The problem of extending the definition to real-valued (positive) r boils down to extending the binomial coefficient to its real-valued counterpart, based on the gamma function:

${\displaystyle {\binom {k+r-1}{k))={\frac {(k+r-1)(k+r-2)\dotsm (r)}{k!))={\frac {\Gamma (k+r)}{k!\,\Gamma (r)))}$

After substituting this expression in the original definition, we say that X has a negative binomial (or Pólya) distribution if it has a probability mass function:

${\displaystyle f(k;r,p)\equiv \Pr(X=k)={\frac {\Gamma (k+r)}{k!\,\Gamma (r)))(1-p)^{k}p^{r}\quad {\text{for ))k=0,1,2,\dotsc }$

Here r is a real, positive number.

In negative binomial regression,^[15] the distribution is specified in terms of its mean, ${\textstyle m={\frac {r(1-p)}{p))}$, which is then related to explanatory variables as in linear regression or other generalized linear models. From the expression for the mean m, one can derive ${\textstyle p={\frac {r}{m+r))}$ and ${\textstyle 1-p={\frac {m}{m+r))}$. Then, substituting these expressions in the one for the probability mass function when r is real-valued, yields this parametrization of the probability mass function in terms of m:

${\displaystyle \Pr(X=k)={\frac {\Gamma (r+k)}{k!\,\Gamma (r)))\left({\frac {r}{r+m))\right)^{r}\left({\frac {m}{r+m))\right)^{k}\quad {\text{for ))k=0,1,2,\dotsc }$

The variance can then be written as ${\textstyle m+{\frac {m^{2)){r))}$. Some authors prefer to set ${\textstyle \alpha ={\frac {1}{r))}$, and express the variance as ${\textstyle m+\alpha m^{2))$. In this context, and depending on the author, either the parameter r or its reciprocal α is referred to as the "dispersion parameter", "shape parameter" or "clustering coefficient",^[16] or the "heterogeneity"^[15] or "aggregation" parameter.^[10] The term "aggregation" is particularly used in ecology when describing counts of individual organisms. Decrease of the aggregation parameter r towards zero corresponds to increasing aggregation of the organisms; increase of r towards infinity corresponds to absence of aggregation, as can be described by Poisson regression.

Alternative parameterizations

Sometimes the distribution is parameterized in terms of its mean μ and variance σ²:

${\displaystyle {\begin{aligned}&p={\frac {\mu }{\sigma ^{2))},\\[6pt]&r={\frac {\mu ^{2)){\sigma ^{2}-\mu )),\\[3pt]&\Pr(X=k)={k+{\frac {\mu ^{2)){\sigma ^{2}-\mu ))-1 \choose k}\left(1-{\frac {\mu }{\sigma ^{2))}\right)^{k}\left({\frac {\mu }{\sigma ^{2))}\right)^{\mu ^{2}/(\sigma ^{2}-\mu )}\\&\operatorname {E} (X)=\mu \\&\operatorname {Var} (X)=\sigma ^{2}.\end{aligned))}$

Another popular parameterization uses r and the failure odds β:

${\displaystyle {\begin{aligned}&p={\frac {1}{1+\beta ))\\&\Pr(X=k)={k+r-1 \choose k}\left({\frac {\beta }{1+\beta ))\right)^{k}\left({\frac {1}{1+\beta ))\right)^{r}\\&\operatorname {E} (X)=r\beta \\&\operatorname {Var} (X)=r\beta (1+\beta ).\end{aligned))}$

Examples

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 via negative binomial regression.^[17][18]

Selling candy

Pat Collis is required to sell candy bars to raise money for the 6th grade field trip. Pat is (somewhat harshly) 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.6 probability of selling one candy bar and a 0.4 probability of selling nothing.

What's the probability of selling the last candy bar at the nth house?

Successfully selling candy enough times is what defines our stopping criterion (as opposed to failing to sell it), so k in this case represents the number of failures and r represents the number of successes. 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):

${\displaystyle f(n)={(n-5)+5-1 \choose n-5}\;(1-0.4)^{5}\;0.4^{n-5}={n-1 \choose n-5}\;3^{5}\;{\frac {2^{n-5)){5^{n))}.}$

What's the probability that Pat finishes on the tenth house?

${\displaystyle 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:

${\displaystyle f(5)=0.07776\,}$

${\displaystyle f(6)=0.15552\,}$

${\displaystyle f(7)=0.18662\,}$

${\displaystyle f(8)=0.17418\,}$

${\displaystyle \sum _{j=5}^{8}f(j)=0.59408.}$

What's the probability that Pat exhausts all 30 houses that happen to stand in the neighborhood?

This can be expressed as the probability that Pat does not finish on the fifth through the thirtieth house:

${\displaystyle 1-\sum _{j=5}^{30}f(j)=1-I_{0.4}(5,30-5+1)\approx 1-0.99999342=0.00000658.}$

Because of the rather high probability that Pat will sell to each house (60 percent), the probability of her NOT fulfilling her quest is vanishingly slim.

Properties

Expectation

The expected total number of trials needed to see r successes is ${\displaystyle {\frac {r}{p))}$. Thus, the expected number of failures would be this value, minus the successes:

${\displaystyle E[\operatorname {NB} (r,p)]={\frac {r}{p))-r={\frac {r(1-p)}{p))}$

Expectation of successes

The expected total number of failures in a negative binomial distribution with parameters (r, p) is r(1 − p)/p. To see this, imagine an experiment simulating the negative binomial is performed many times. That is, a set of trials is performed until r successes 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 Np successes in total. Say the experiment was performed n times. Then there are nr successes in total. So we would expect nr = Np, so N/n = r/p. See that N/n is just the average number of trials per experiment. That is what we mean by "expectation". The average number of failures per experiment is N/n − r = r/p − r = r(1 − p)/p. This agrees with the mean given in the box on the right-hand side of this page.

A rigorous derivation can be done by representing the negative binomial distribution as the sum of waiting times. Let ${\displaystyle X_{r}\sim \operatorname {NB} (r,p)}$ with the convention ${\displaystyle X}$ represents the number of failures observed before ${\displaystyle r}$ successes with the probability of success being ${\displaystyle p}$. And let ${\displaystyle Y_{i}\sim Geom(p)}$ where ${\displaystyle Y_{i))$ represents the number of failures before seeing a success. We can think of ${\displaystyle Y_{i))$ as the waiting time (number of failures) between the ${\displaystyle i}$th and ${\displaystyle (i-1)}$th success. Thus

${\displaystyle X_{r}=Y_{1}+Y_{2}+\cdots +Y_{r}.}$

The mean is

${\displaystyle E[X_{r}]=E[Y_{1}]+E[Y_{2}]+\cdots +E[Y_{r}]={\frac {r(1-p)}{p)),}$

which follows from the fact ${\displaystyle E[Y_{i}]=(1-p)/p}$.

Variance

When counting the number of failures before the r-th success, the variance is r(1 − p)/p². When counting the number of successes before the r-th failure, as in alternative formulation (3) above, the variance is rp/(1 − p)².

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

${\displaystyle 1=1^{n}=(p+q)^{n}.}$

Using Newton's binomial theorem, this can equally be written as:

${\displaystyle (p+q)^{n}=\sum _{k=0}^{\infty }{n \choose k}p^{k}q^{n-k},}$

in which the upper bound of summation is infinite. In this case, the binomial coefficient

${\displaystyle {n \choose k}={n(n-1)(n-2)\cdots (n-k+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

${\displaystyle (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:

${\displaystyle 1=p^{r}\cdot p^{-r}=p^{r}(1-q)^{-r}=p^{r}\sum _{k=0}^{\infty }{-r \choose k}(-q)^{k}.}$

Then all of the terms are positive, and the term

${\displaystyle 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 non-integer, so that the exponent is a positive non-integer, 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 non-integer 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 negative-binomially distributed random variables r₁ and r₂ with the same value for parameter p is negative-binomially distributed with the same p but with r-value r₁ + r₂.

This property persists when the definition is thus generalized, and affords a quick way to see that the negative binomial distribution is infinitely divisible.

Recurrence relations

The following recurrence relations hold:

For the probability mass function

${\displaystyle {\begin{cases}(k+1)\Pr(X=k+1)-p\Pr(X=k)(k+r)=0,\\[5pt]\Pr(X=0)=(1-p)^{r}.\end{cases))}$

For the moments ${\displaystyle m_{k}=\mathbb {E} (X^{k}),}$

${\displaystyle m_{k+1}=rPm_{k}+(P^{2}+P){dm_{k} \over dP},\quad P:=(1-p)/p,\quad m_{0}=1.}$

For the cumulants

${\displaystyle \kappa _{k+1}=(Q-1)Q{d\kappa _{k} \over dQ},\quad Q:=1/p,\quad \kappa _{1}=r(Q-1).}$

Related distributions

• The geometric distribution (on { 0, 1, 2, 3, ... }) is a special case of the negative binomial distribution, with

${\displaystyle \operatorname {Geom} (p)=\operatorname {NB} (1,\,p).\,}$

• The negative binomial distribution is a special case of the discrete phase-type distribution.
• The negative binomial distribution is a special case of discrete compound Poisson distribution.

Poisson distribution

Consider a sequence of negative binomial random variables where the stopping parameter r goes to infinity, while the probability p of success in each trial goes to one, in such a way as to keep the mean of the distribution (i.e. the expected number of failures) constant. Denoting this mean as λ, the parameter p will be p = r/(r + λ)

${\displaystyle {\begin{aligned}{\text{Mean:))\quad &\lambda ={\frac {(1-p)r}{p))\quad \Rightarrow \quad p={\frac {r}{r+\lambda )),\\{\text{Variance:))\quad &\lambda \left(1+{\frac {\lambda }{r))\right)>\lambda ,\quad {\text{thus always overdispersed)).\end{aligned))}$

Under this parametrization the probability mass function will be

${\displaystyle f(k;r,p)={\frac {\Gamma (k+r)}{k!\cdot \Gamma (r)))(1-p)^{k}p^{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:

${\displaystyle \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 Poisson-distributed 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.

${\displaystyle \operatorname {Poisson} (\lambda )=\lim _{r\to \infty }\operatorname {NB} \left(r,{\frac {r}{r+\lambda ))\right).}$

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 θ = (1 − p)/p or correspondingly rate β = p/(1 − p).

To display the intuition behind this statement, consider two independent Poisson processes, "Success" and "Failure", with intensities p and 1 − p. Together, the Success and Failure processes are equivalent to a single Poisson process of intensity 1, where an occurrence of the process is a success if a corresponding independent coin toss comes up heads with probability p; otherwise, it is a failure. If r is a counting number, the coin tosses show that the count of successes before the rth failure follows a negative binomial distribution with parameters r and p. The count is also, however, the count of the Success Poisson process at the random time T of the rth occurrence in the Failure Poisson process. The Success count follows a Poisson distribution with mean pT, where T is the waiting time for r occurrences in a Poisson process of intensity 1 − p, i.e., T is gamma-distributed with shape parameter r and intensity 1 − p. Thus, the negative binomial distribution is equivalent to a Poisson distribution with mean pT, where the random variate T is gamma-distributed with shape parameter r and intensity (1 − p). The preceding paragraph follows, because λ = pT is gamma-distributed with shape parameter r and intensity (1 − p)/p.

The following formal derivation (which does not depend on r being a counting number) confirms the intuition.

${\displaystyle {\begin{aligned}&\int _{0}^{\infty }f_{\operatorname {Poisson} (\lambda )}(k)\times f_{\operatorname {Gamma} \left(r,\,{\frac {p}{1-p))\right)}(\lambda )\,\mathrm {d} \lambda \\[8pt]={}&\int _{0}^{\infty }{\frac {\lambda ^{k)){k!))e^{-\lambda }\times {\frac {1}{\Gamma (r)))\left({\frac {p}{1-p))\lambda \right)^{r-1}e^{-{\frac {p}{1-p))\lambda }\,\left({\frac {p}{1-p))\,\right)\mathrm {d} \lambda \\[8pt]={}&\left({\frac {p}{1-p))\right)^{r}{\frac {1}{k!\,\Gamma (r)))\int _{0}^{\infty }\lambda ^{r+k-1}e^{-\lambda {\frac {p+1-p}{1-p))}\;\mathrm {d} \lambda \\[8pt]={}&\left({\frac {p}{1-p))\right)^{r}{\frac {1}{k!\,\Gamma (r)))\Gamma (r+k)(1-p)^{k+r}\int _{0}^{\infty }f_{\operatorname {Gamma} \left(k+r,{\frac {1}{1-p))\right)}(\lambda )\;\mathrm {d} \lambda \\[8pt]={}&{\frac {\Gamma (r+k)}{k!\;\Gamma (r)))\;(1-p)^{k}\,p^{r}\\[8pt]={}&f(k;r,p).\end{aligned))}$

Because of this, the negative binomial distribution is also known as the gamma–Poisson (mixture) distribution. The negative binomial distribution was originally derived as a limiting case of the gamma-Poisson distribution.^[19]

Distribution of a sum of geometrically distributed random variables

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 p. 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 p, then

${\displaystyle {\begin{aligned}\Pr(Y_{r}\leq s)&{}=1-I_{p}(s+1,r)\\[5pt]&{}=1-I_{p}((s+r)-(r-1),(r-1)+1)\\[5pt]&{}=1-\Pr(B_{s+r}\leq r-1)\\[5pt]&{}=\Pr(B_{s+r}\geq r)\\[5pt]&{}=\Pr({\text{after ))s+r{\text{ trials, there are at least ))r{\text{ successes))).\end{aligned))}$

In this sense, the negative binomial distribution is the "inverse" of the binomial distribution.

The sum of independent negative-binomially distributed random variables r₁ and r₂ with the same value for parameter p is negative-binomially distributed with the same p but with r-value r₁ + r₂.

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₁, ..., 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 ${\textstyle (Y_{n})_{n\,\in \,\mathbb {N} ))$ denote a sequence of independent and identically distributed random variables, each one having the logarithmic series distribution Log(p), with probability mass function

${\displaystyle f(k;r,p)={\frac {-p^{k)){k\ln(1-p))),\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

${\displaystyle 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

${\displaystyle G_{N}(z)=\exp(\lambda (z-1)),\qquad z\in \mathbb {R} ,}$

and

${\displaystyle G_{Y_{1))(z)={\frac {\ln(1-pz)}{\ln(1-p))),\qquad |z|<{\frac {1}{p)),}$

we obtain

${\displaystyle {\begin{aligned}G_{X}(z)&=G_{N}(G_{Y_{1))(z))\\[4pt]&=\exp {\biggl (}\lambda {\biggl (}{\frac {\ln(1-pz)}{\ln(1-p)))-1{\biggr )}{\biggr )}\\[4pt]&=\exp {\bigl (}-r(\ln(1-pz)-\ln(1-p)){\bigr )}\\[4pt]&={\biggl (}{\frac {1-p}{1-pz)){\biggr )}^{r},\qquad |z|<{\frac {1}{p)),\end{aligned))}$

which is the probability generating function of the NB(r,p) distribution.

The following table describes four distributions related to the number of successes in a sequence of draws:

(a,b,0) class of distributions

The negative binomial, along with the Poisson and binomial distributions, is a member of the (a,b,0) class of distributions. All three of these distributions are special cases of the Panjer distribution. They are also members of a natural exponential family.

Statistical inference

Parameter estimation

MVUE for 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

${\displaystyle {\widehat {p))={\frac {r-1}{r+k-1)).}$

Maximum likelihood estimation

When r is known, the maximum likelihood estimate of p is

${\displaystyle {\widetilde {p))={\frac {r}{r+k)),}$

but this is a biased estimate. Its inverse (r + k)/r, is an unbiased estimate of 1/p, however.^[20]

When r is unknown, the maximum likelihood estimator for p and r together only exists for samples for which the sample variance is larger than the sample mean.^[21] The likelihood function for N iid observations (k₁, ..., k_N) is

${\displaystyle L(r,p)=\prod _{i=1}^{N}f(k_{i};r,p)\,\!}$

from which we calculate the log-likelihood function

${\displaystyle \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(1-p)+Nr\ln(p).}$

To find the maximum we take the partial derivatives with respect to r and p and set them equal to zero:

${\displaystyle {\frac {\partial \ell (r,p)}{\partial p))=-\left[\sum _{i=1}^{N}k_{i}{\frac {1}{1-p))\right]+Nr{\frac {1}{p))=0}$ and

${\displaystyle {\frac {\partial \ell (r,p)}{\partial r))=\left[\sum _{i=1}^{N}\psi (k_{i}+r)\right]-N\psi (r)+N\ln(p)=0}$

where

${\displaystyle \psi (k)={\frac {\Gamma '(k)}{\Gamma (k)))\!}$ is the digamma function.

Solving the first equation for p gives:

${\displaystyle p={\frac {Nr}{Nr+\sum _{i=1}^{N}k_{i))))$

Substituting this in the second equation gives:

${\displaystyle {\frac {\partial \ell (r,p)}{\partial r))=\left[\sum _{i=1}^{N}\psi (k_{i}+r)\right]-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. Alternatively, the expectation–maximization algorithm can be used.^[21]

Occurrence and applications

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 success on each trial is 5/6. The number of successes before the third failure belongs to the infinite set { 0, 1, 2, 3, ... }. That number of successes is a negative-binomially 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:

${\displaystyle f(k;r,p)=(1-p)\cdot p^{k}\!}$

Recent findings suggest that the waiting time in a Bernoulli process is strongly related to fractals and Dirichlet function. Probability distributions with fractal properties that are related to Dirichlet function can be derived from recurrent processes generated by uniform discrete distributions. Such uniform discrete distributions can be pi digits, flips of a fair dice or live casino spins. Consider the following waiting time in a Bernoulli process: A random variable C_i is repeatedly sampled N times from a discrete uniform distribution, where i ranges from 1 to N. For instance, consider integer values ranging from 1 to 10. Moments of occurrence, T_k, signify when events C_i repeat, defined as C_i = C_i-1 or C_i = C_i-2, where k ranges from 1 to M, with M being less than N. Subsequently, define S_j as the interval between successive T_k, representing the waiting time for an event to occur. Finally, introduce Z_l as ln(S_j) – ln(S_j-1), where l ranges from 1 to U-1. The random variable Z displays fractal properties, resembling the shape distribution akin to Thomae's or Dirichlet function. ^[22]

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 6-monthly counts of wintertime extratropical cyclones over Europe, for which the variance is greater than the mean.^[23][24][25] In the case of modest overdispersion, this may produce substantially similar results to an overdispersed Poisson distribution.^[26][27]

Negative binomial modeling is widely employed in ecology and biodiversity research for analyzing count data where overdispersion is very common. This is because overdispersion is indicative of biological aggregation, such as species or communities forming clusters. Ignoring overdispersion can lead to significantly inflated model parameters, resulting in misleading statistical inferences. The negative binomial distribution effectively addresses overdispersed counts by permitting the variance to vary quadratically with the mean. An additional dispersion parameter governs the slope of the quadratic term, determining the severity of overdispersion. The model's quadratic mean-variance relationship proves to be a realistic approach for handling overdispersion, as supported by empirical evidence from many studies. Overall, the NB model offers two attractive features: (1) the convenient interpretation of the dispersion parameter as an index of clustering or aggregation, and (2) its tractable form, featuring a closed expression for the probability mass function.^[28]

In genetics, the negative binomial distribution is commonly used to model data in the form of discrete sequence read counts from high-throughput RNA and DNA sequencing experiments.^{[29][30][31][32]}

In epidemiology of infectious diseases, the negative binomial has been used as a better option than the Poisson distribution to model overdispersed counts of secondary infections from one infected case (super-spreading events).^[33]

Multiplicity observations (physics)

The negative binomial distribution has been the most effective statistical model for a broad range of multiplicity observations in particle collision experiments, e.g., ${\displaystyle p{\bar {p)),\ hh,\ hA,\ AA,\ e^{+}e^{-))$ ^{[34][35][36][37][38]} (See ^[39] for an overview), and is argued to be a scale-invariant property of matter,^[40][41] providing the best fit for astronomical observations, where it predicts the number of galaxies in a region of space.^{[42][43][44][45]} The phenomenological justification for the effectiveness of the negative binomial distribution in these contexts remained unknown for fifty years, since their first observation in 1973.^[46] In 2023, a proof from first principles was eventually demonstrated by Scott V. Tezlaf, where it was shown that the negative binomial distribution emerges from symmetries in the dynamical equations of a canonical ensemble of particles in Minkowski space.^[47] Roughly, given an expected number of trials ${\displaystyle \langle n\rangle }$ and expected number of successes ${\displaystyle \langle r\rangle }$, where

${\displaystyle \langle {\mathcal {n))\rangle -\langle r\rangle =k,\quad \quad \langle p\rangle ={\frac {\langle r\rangle }{\langle {\mathcal {n))\rangle ))\quad \quad \quad \implies \quad \quad \quad \langle {\mathcal {n))\rangle ={\frac {k}{1-\langle p\rangle )),\quad \quad \langle {r}\rangle ={\frac {k\langle p\rangle }{1-\langle p\rangle )),}$

an isomorphic set of equations can be identified with the parameters of a relativistic current density of a canonical ensemble of massive particles, via

${\displaystyle c^{2}\langle \rho ^{2}\rangle -\langle j^{2}\rangle =c^{2}\rho _{0}^{2},\quad \quad \quad \langle \beta _{v}^{2}\rangle ={\frac {\langle j^{2}\rangle }{c^{2}\langle \rho ^{2}\rangle ))\quad \quad \implies \quad \quad c^{2}\langle \rho ^{2}\rangle ={\frac {c^{2}\rho _{0}^{2)){1-\langle \beta _{v}^{2}\rangle )),\quad \quad \quad \langle j^{2}\rangle ={\frac {c^{2}\rho _{0}^{2}\langle \beta _{v}^{2}\rangle }{1-\langle \beta _{v}^{2}\rangle )),}$

where ${\displaystyle \rho _{0))$ is the rest density, ${\displaystyle \langle \rho ^{2}\rangle }$ is the relativistic mean square density, ${\displaystyle \langle j^{2}\rangle }$ is the relativistic mean square current density, and ${\displaystyle \langle \beta _{v}^{2}\rangle =\langle v^{2}\rangle /c^{2))$, where ${\displaystyle \langle v^{2}\rangle }$ is the mean square speed of the particle ensemble and ${\displaystyle c}$ is the speed of light—such that one can establish the following bijective map:

${\displaystyle c^{2}\rho _{0}^{2}\mapsto k,\quad \quad \langle \beta _{v}^{2}\rangle \mapsto \langle p\rangle ,\quad \quad c^{2}\langle \rho ^{2}\rangle \mapsto \langle {\mathcal {n))\rangle ,\quad \quad \langle j^{2}\rangle \mapsto \langle r\rangle .}$

A rigorous alternative proof of the above correspondence has also been demonstrated through quantum mechanics via the Feynman path integral.^[47]

History

This distribution was first studied in 1713 by Pierre Remond de Montmort in his Essay d'analyse sur les jeux de hazard, as the distribution of the number of trials required in an experiment to obtain a given number of successes.^[48] It had previously been mentioned by Pascal.^[49]