Mathematics · Glossary

What is Probability generating function?

Definition 23.1 University Mathematics — Year 2 · Chapter 23 — Probability Generating Functions

Let XX be an N\N-valued random variable, pn=P(X=n)p_n = \P(X = n). The probability generating function of XX is the sum of the power series

GX(t)=E(tX)=n=0pntn.G_X(t) = \E\bigl(t^X\bigr) = \sum_{n=0}^{\infty} p_n\,t^n .

Examples

Example 23.2 (First reflexes)

A constant variable X=cX = c has GX(t)=tcG_X(t) = t^c; a shift obeys GX+c(t)=tcGX(t)G_{X+c}(t) = t^c\,G_X(t); and evaluating at special points reads off information without any expansion: GX(0)=P(X=0)G_X(0) = \P(X = 0), GX(1)=1G_X(1) = 1, and GX(1)=P(X even)P(X odd)G_X(-1) = \P(X\text{ even}) - \P(X\text{ odd}), the parity balance exploited in Exercise 23.10. These one-liners are used silently everywhere below — and the evaluation GX(0)G_X(0) is exactly how extinction probabilities will be extracted from iterated generating functions at the end of the chapter.

Example 23.5 (Integrating the generating function)

Derivatives of GXG_X at 11 give positive moments; the integral gives a negative one. From 01tk ⁣dt=1k+1\int_0^1t^k\dd t = \frac1{k+1} and term-by-term integration (normal convergence on [0,1]\intcc01):

01GX(t) ⁣dt=k0P(X=k)k+1=E(11+X).\int_0^1G_X(t)\,\dd t = \sum_{k\geq0}\frac{\P(X = k)}{k+1} = \E\Bigl(\frac1{1+X}\Bigr).

For XP(λ)X \sim \mathcal P(\lambda):

E(11+X)=01eλ(t1) ⁣dt=1eλλ,\E\Bigl(\frac1{1+X}\Bigr) = \int_0^1\eu^{\lambda(t-1)}\,\dd t = \frac{1 - \eu^{-\lambda}}{\lambda},

recovering in one line the series computation of Example 22.10. The generating function is a two-way instrument: differentiate at 11 for the moments E(X)\E(X), E(X(X1))\E(X(X-1)), integrate over [0,1]\intcc01 for E(11+X)\E\bigl(\frac1{1+X}\bigr) — one analytic object, queried in whichever direction the problem needs.

Example 23.6 (A law with radius exactly one)

Let P(X=k)=6π2k2\P(X = k) = \dfrac{6}{\pi^2k^2} for k1k \geq 1 — a probability law by Basel’s identity (Example 14.12). Its generating function G(t)=6π2k1tkk2G(t) = \frac6{\pi^2}\sum_{k\geq1}\frac{t^k}{k^2} has radius of convergence exactly 11: the general bound “radius 1\geq 1” of Proposition 23.3 cannot be improved. And the mean is

k1kP(X=k)=6π2k11k=:\sum_{k\geq1}k\,\P(X = k) = \frac6{\pi^2}\sum_{k\geq1}\frac1k = \infty :

GG is continuous on [1,1]\intcc{-1}1, smooth inside, but its derivative blows up at 11^- — the graph arrives at the point (1,1)(1, 1) with a vertical tangent. Heavy tails are visible geometrically on the generating function, at the single point t=1t = 1; the moments theorem below makes this correspondence exact.

Read in context →