FS1 7.1 - Generating functions of standard distributions
A probability generating function stores an entire discrete distribution in one expression. You will construct and check these functions, derive the four standard forms, recover exact probabilities and transform the values of a random variable (FS1 7.1).
Store the value in the power and its probability in the coefficient
The expression contains a complete probability distribution. Could evaluating it at just tell you how likely an even outcome is?
Start by reading its pieces: the constant stores probability at value , the coefficient of stores probability at value , and the coefficient of stores probability at value . The missing means probability zero at value .
You already know
For a discrete variable, . Core Pure Maclaurin work gives the coefficient of as , where the expansion applies. Use the standard exponential and binomial series with their conditions.
Here the function applied to the random value is . The letter is an input, not another random variable.
Probability generating function
For a non-negative integer-valued random variable , its probability generating function, or PGF, is
For finite support the sum is a polynomial. For infinite support it is a power series, used where it converges. In particular it converges for . The definition is in the formula booklet.
A PGF is a weighted list in algebraic form, rather than a density or a cumulative probability. Its value at an arbitrary input is usually neither a point probability nor a cumulative probability.
Reading and checking a PGF
For a non-negative integer-valued variable,
The coefficient of is . Equivalently, using the Maclaurin coefficient rule,
Every coefficient must be non-negative. Normalisation alone is not enough to establish a valid PGF.
Not in the formula booklet: learn it.
Substituting adds all the coefficients, whereas substituting isolates the constant term. Substituting adds the even-power probabilities and subtracts the odd-power probabilities. Thus measures the difference between even and odd probabilities: a surprisingly compact way to ask about parity. We will finish the opening calculation after working with the encoding.
Key idea
The exponent is the possible value; its coefficient is the probability. Check both non-negative coefficients and total probability .
Use both checks rather than accepting any expression that equals one at .
Normalising a PGF and reading exact probabilities
Find an unknown normalising constant using , then read the required coefficients.
For a finite distribution, form one term for each possible value. Include a missing power with coefficient zero when adding a range of probabilities. For example, adds the coefficients at powers ; it does not mean substitute .
Worked example 1: an unknown scale factor
Question. A non-negative integer-valued variable has PGF . Find and .
Plan. Normalise at , then add the constant and linear coefficients.
Why this step? Setting would give only , which need not equal .
Answer. and .
Check. All three probabilities are non-negative and add to ; the probability at value is zero.
Worked example 2 changes only the unnormalised weight at value , from to . The whole expression must be normalised again.
Worked example 2: changing one weight
Question. A variable has PGF . Find and .
Plan. Recalculate the total coefficient weight before reading probabilities.
Why this step? Retaining would make the probabilities add to . Changing one weight changes the scale of every probability.
Answer. and .
Check. The remaining probability is , complementing .
You can reverse the process: a table with values and probabilities generates precisely this polynomial.
Watch out
Wrong: . That value is always . Right: add the coefficients belonging to outcomes at most ; keep the argument of a function separate from the outcome threshold.
Increase the same unnormalised weight once more.
Deriving the PGFs of count distributions
Insert the probability formula into the PGF definition, then recognise a binomial or exponential expansion.
For , let . The binomial theorem gives
For , the exponential series gives
Both derivations start with the definition; merely copying the final supplied expression would not show a derivation.
Binomial and Poisson PGFs
Here is a non-negative integer, , and the polynomial is valid for all real .
Here , and the exponential series converges for all real .
In the formula booklet.
The factor must remain when extracting Poisson coefficients. For example, gives , so the probability at value is , rather than .
Worked example 3: adding the first three coefficients
Question. Let . Find its PGF and use it to find exactly.
Plan. Substitute into the binomial PGF and retain its constant, linear and quadratic terms.
Why this step? The quadratic coefficient includes . A Maclaurin alternative must divide by , giving the same coefficient.
Answer. , and .
Check. Direct binomial probabilities at give the same three coefficients, and .
Worked example 4 changes only the trial count, from to . The success probability and event remain fixed.
Worked example 4: one more trial
Question. Let . Find its PGF and use it to find exactly.
Plan. Increase the PGF's power and recalculate the first three coefficients.
Why this step? The quadratic numerator is ; changing the trial count changes the coefficient as well as the denominator.
Answer. , and .
Check. The probability is smaller than , as an extra independent trial can add a success but cannot remove an existing one.
Expanding a rational or exponential PGF uses the same coefficient rule. If using derivatives, evaluate at zero for probabilities; the next lesson uses derivatives at one for moments.
Watch out
Wrong: , or evaluate that derivative at . Right: divide by . Keep exact fractions when the question requests an exact probability.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account