University Maths Notes: Probability and Statistics – Probability Generating Functions
The probability-generating function of a discrete random variable is a power series representation of the probability mass function of the random variable.
If
is
a discrete random variable taking values in the non-negative
integers
then
the probability-generating function of
is
defined as
where
is
the probability mass function of![]()
If
is a discrete random variable taking values in the d-dimensional
non-negative integer lattice
then
the probability-generating function of
is
defined as
where
is
the probability mass function of X. The power series converges
absolutely for all complex vectors
with![]()
Probability generating functions obey all the rules of power series with non-negative coefficients.
The following properties allow the derivation of various basic
quantities related to![]()
1. The probability mass function of
is
recovered by taking derivatives of![]()
2. If two probability distributions has the same probability generating function then they are the same distribution.
The expectation of
is
given by
where
indicates
from
below.
More generally, the kth factorial moment,
of
X is given by
So
the variance of X is given by![]()
3.
where
is
a random variable,
is
the probability generating function and
is
the moment-generating function.
Probability-generating functions are useful when several independent random variables are involved. For example:
If
is
a sequence of independent random variables, and![]()
Example:
The probability-generating function of a constant random
variable, i.e. one with
is![]()
The probability-generating function of a binomial random
variable, the number of successes in
trials,
with probability
of
success in each trial, is![]()
The probability-generating function of a negative binomial
random variable, the number of failures occurring before the
th
success with probability of success in each trial
is
The probability-generating function of a Poisson random variable
with rate parameter
is