In probability theory, the factorial moment is a mathematical quantity defined as the expectation or average of the falling factorial of a random variable. Factorial moments are useful for studying non-negative integer-valued random variables,[1] and arise in the use of probability-generating functions to derive the moments of discrete random variables.
Factorial moments serve as analytic tools in the mathematical field of combinatorics, which is the study of discrete mathematical structures.[2]
For a natural number, the -th factorial moment of a probability distribution on the real or complex numbers, or, in other words, a random variable with that probability distribution, is[3]
\operatorname{E}l[(X)rr]=\operatorname{E}l[X(X-1)(X-2) … (X-r+1)r],
where the is the expectation (operator) and
(x)r:=\underbrace{x(x-1)(x-2) … (x-r+1)}r\equiv
| x! | |
| (x-r)! |
is the falling factorial, which gives rise to the name, although the notation varies depending on the mathematical field. Of course, the definition requires that the expectation is meaningful, which is the case if or .
If is the number of successes in trials, and is the probability that any of the trials are all successes, then[4]
\operatorname{E}l[(X)rr]=n(n-1)(n-2) … (n-r+1)pr
If a random variable has a Poisson distribution with parameter λ, then the factorial moments of are
\operatorname{E}l[(X)rr]=λr,
which are simple in form compared to its moments, which involve Stirling numbers of the second kind.
If a random variable has a binomial distribution with success probability and number of trials, then the factorial moments of are[5]
\operatorname{E}l[(X)rr]=\binom{n}{r}prr!=(n)rpr,
where by convention,
style{\binom{n}{r}}
(n)r
If a random variable has a hypergeometric distribution with population size, number of success states in the population, and draws, then the factorial moments of are [5]
\operatorname{E}l[(X)rr]=
| \binom{K | |
| r |
\binom{n}{r}r!}{\binom{N}{r}}=
| (K)r(n)r | |
| (N)r |
.
If a random variable has a beta-binomial distribution with parameters,, and number of trials, then the factorial moments of are
\operatorname{E}l[(X)rr]=\binom{n}{r}
| B(\alpha+r,\beta)r! | |
| B(\alpha,\beta) |
= (n)r
| B(\alpha+r,\beta) | |
| B(\alpha,\beta) |
The rth raw moment of a random variable X can be expressed in terms of its factorial moments by the formula
\operatorname{E}[Xr]=
| r | |
| \sum | |
| j=0 |
\left\{{r\atopj}\right\}\operatorname{E}[(X)j],
where the curly braces denote Stirling numbers of the second kind.
. John Riordan (mathematician). Introduction to Combinatorial Analysis. 1958. Dover.
. John Riordan (mathematician). Introduction to Combinatorial Analysis. 1958. Dover. 30.