transforms
Probability Generating Functions
You should know: discrete probability distributions, expectation
Overview
The probability generating function (PGF) is a power-series transform that encodes the entire probability distribution of a non-negative integer-valued random variable in a single analytic function. It is especially useful for discrete distributions (Binomial, Poisson, Geometric, Negative Binomial) and for analysing branching processes, queueing systems, and random walks. The PGF of a sum of independent variables is the product of their PGFs — mirroring the role of the characteristic function but tailored to discrete settings.
Intuition
Think of the PGF as a polynomial whose coefficients are probabilities: the coefficient of zᵏ is exactly P(X = k). Multiplying two PGFs is equivalent to convolving two distributions (computing probabilities of the sum), since (Σ pₖ zᵏ)(Σ qₖ zᵏ) = Σ (Σ pⱼ q_{k-j}) zᵏ. Evaluating the PGF and its derivatives at z = 1 gives moments: G'(1) = E[X], G''(1) = E[X(X−1)], and so on.
Formal Definition
For a non-negative integer-valued random variable X, the probability generating function G_X(z) is defined for |z| ≤ 1 (and often for |z| in a neighbourhood of 1) by:
Worked Examples
- 1
Sum the geometric series.
- 2
This is valid for |z| < 1/(1−p).
✓ Answer
G_X(z) = pz / [1 − (1−p)z].
Practice Problems
Find the PGF of X ~ Bernoulli(p).
If X ~ Binomial(n, p), what is the PGF? Use the Bernoulli PGF and independence.
Quiz
Summary
- The PGF G_X(z) = E[z^X] = Σ P(X=k) zᵏ encodes the full distribution of a non-negative integer-valued variable.
- Probabilities are the Taylor coefficients: P(X=k) = G^{(k)}(0)/k!
- Moments: E[X] = G'(1), E[X(X−1)] = G''(1).
- For independent variables, PGFs multiply: G_{X+Y} = G_X · G_Y.
Mathematics