Addition of independent Poisson random variables Created 2026-09-28 Updated 2026-11-05
The sum of independent Poisson random variables is Poisson, with parameter equal to the sum of their parameters. This follows by multiplying their probability generating functions .
Aggregate recursion for zero-truncated Panjer counts Created 2026-10-14 Updated 2026-11-05
Let have probability mass function satisfying for . Let independent positive integer claim sizes have probability mass function , independently of . The aggregate probability mass function satisfies the displayed recursion, with . To prove it, write for the count, severity and aggregate probability generating functions. The count recurrence gives . Since , the chain rule gives . Comparing coefficients of gives the recursion. The forcing term distinguishes this algorithm from the usual Panjer recursion. For a zero-truncated Poisson distribution with parameter , take , and .
Binomial accident portfolio with Poisson clusters Created 2026-10-14 Updated 2026-11-05
For independent factories with accident probability , and independent Poisson distribution claim counts of mean per accident, the accident count is binomial and each accident supplies a cluster. The random-sum transform identity gives the displayed probability generating function. In particular the no-claim chance is ; a factory with an accident can still have zero claims. The binomial accident law has Panjer parameters and .
Binomial branching process 2026-10-07
A Galton-Watson process whose offspring law is a binomial distribution has mean and the displayed offspring probability generating function. Its branching extinction probability is the smallest root of in . It dominates a breadth-first exploration of a binomial random graph by allowing each explored vertex up to independent possible children, including previously exposed or already discovered vertices as phantom children.
For offspring with and , let be the branching extinction probability. Conditioning on extinction changes the offspring law to with the displayed parameter. Indeed, the probability of children is multiplied by , so the new probability generating function is . Since and , this equals . Its mean is , because strict convexity of and its zeros at and one force a negative derivative at the smaller zero. The conditioned process therefore has an exponentially decaying total-progeny tail. Unconditionally that tail instead converges to the survival mass , with an exponentially small correction. When extinction has probability zero, conditioning on it does not define this law.
Use the zero-based geometric distribution, with for and . After binomial thinning with retention probability , the retained count is again zero-based geometrically distributed, with the displayed success probability. Indeed, writing , its probability generating function isFor this includes the degenerate success parameter and retained count zero.
Branching process conditioned on extinction 2026-10-07
Let be the branching extinction probability of a Galton-Watson process with offspring probability generating function . Conditional on extinction, the probability of children is multiplied by : every child's descendants must also become extinct. Hence the new probability generating function is and its mean is . If , the total progeny of a branching process has conditional expected value , and unconditionally . The Markov inequality gives a finite-total-progeny tail bound without discarding the survival mass.
Branching-process extinction criterion Created 2026-09-24 Updated 2026-11-05
For a Galton-Watson process starting from one individual, let be its offspring probability generating function and its offspring mean. The branching extinction probability is the smallest solution of in . Except for deterministic one-child reproduction, extinction is certain when and has probability less than one when . Iterate , to obtain the probabilities of extinction by successive generations and their limit. For , the mean is one and extinction is certain despite possible initial growth.[ref]
Capped geometric waiting time Created 2026-10-07 Updated 2026-11-05
For a positive-integer geometric distribution with , the capped time has masses for and at . The last mass includes all later arrivals, not only . Its probability generating function and expected value areThe expectation follows either by differentiating the PGF or summing the tail probabilities up to .
Assign each of claims with independent category labels to one of finitely many categories with probabilities . Conditional counts have a multinomial distribution with probability generating function . Averaging over gives . This proves independent category counts and supports discrete-severity compound Poisson distribution representations.
Claim count Created 2026-10-14 Updated 2026-11-05
The number of insurance claims in a specified exposure period. Its probability generating function combines with the moment-generating function of an independent claim size through the random-sum transform identity. A Poisson distribution, geometric distribution, or negative binomial distribution provides a possible count model, with different dispersion and zero-claim probabilities.
Claim count distribution Created 2026-10-07 Updated 2026-10-14
The probability distribution of the nonnegative integer number of claims over a specified accounting period. Its probability generating function determines the count probabilities. A Poisson distribution gives equal count expected value and variance; a Poisson mixture allows heterogeneity in the underlying risk intensity.
Coefficient extraction recovers every probability mass:Indeed, termwise differentiation of a power series is valid inside ; evaluating the th derivative at zero kills every term except . Thus two probability generating functions with the same coefficients describe the same probability distribution, without any finite-moment assumption.
At one, approach along the real line from below. For each positive integer , termwise differentiation of a power series followed by the monotone convergence theorem gives the factorial momentFor integer , set . The limit may be infinite; it is a finite boundary value only when the corresponding factorial moment is finite. In particular, a finite first moment givesand a finite second moment givesThe variance formula follows from . These are boundary limits of derivatives; they do not assert that the probability generating function extends smoothly through one.
For a nonnegative integer-valued random variable, its moment-generating function satisfies wherever finite. The guaranteed probability generating function domain therefore supplies finite values for real ; it does not guarantee positive exponential moments or a finite moment-generating function on a neighborhood of zero. Bounded nonnegative integer-valued random variables have polynomial probability generating functions, but their convenient behavior is not a general existence theorem.
Dirichlet probability generating function Created 2026-10-14 Updated 2026-11-05
For a positive integer-valued random variable of finite support, this transform is a finite Dirichlet series. Its values encode ordinary moments, , and its derivatives at zero encode logarithmic moments: . Positive support is essential to these definitions; the transform is distinct from the ordinary probability generating function .
Distribution of a critical linear birth-death population Created 2026-10-25 Updated 2026-11-05
For equal individual birth and death rates and one initial individual, the probability generating function is . It solves with , and its geometric expansion gives the displayed probabilities. The mean remains one and the variance is , although extinction occurs with probability tending to one. The surviving fraction has conditional mean population .
Finite-horizon total progeny generating function Created 2026-10-14 Updated 2026-10-25
Count the ancestor and the next generations of a Galton-Watson process. Conditioning on the ancestor's offspring, their independent descendant trees each have the preceding finite-horizon probability generating function, proving the displayed recursion. If the count instead excludes the ancestor, the recursion is with . The indexing convention must be specified.
First-return generating function of the simple symmetric random walk Created 2026-10-06 Updated 2026-11-05
For the simple symmetric random walk on , the renewal equation relates first-return and return probability generating functions. The central-binomial return series is , giving . Its value tends to one at , but its derivative diverges there: the walk has null recurrent states.
For , this probability generating function has probabilities and for , where the product after is empty for . All probabilities are positive and sum to one, while the expected value is infinite. In a Galton-Watson process starting with one individual, the generation- probability generating function is . The branching extinction probability is , obtained by taking the limit of and using that extinction by generation is an increasing sequence of events.
Galton-Watson extinction fixed point Created 2026-09-24 Updated 2026-10-14
For a Galton-Watson process with one ancestor and offspring probability generating function , the branching extinction probability is the smallest fixed point of in . A direct way to find it is to compute extinction by generation :Zero is an absorbing state, so extinction by generation is exactly the event . [ref]
https://ocw.mit.edu/courses/18-445-introduction-to-stochastic-processes-spring-2015/27aaeb9eb9a9cecce93d9ad74413ddf5_MIT18_445S15_lecture19.pdf. Hao Wu, MIT 18.445, Lecture 19, slide 4
For , the equation isBoth and are fixed points, but iteration from zero selects . The first values are , , , and . Iteration started at would stay at forever and would give the wrong extinction answer for this offspring distribution.
The smallest extinction fixed point selected by iteration from zero
. Details. The vertical steps in the figure apply the offspring probability generating function; horizontal steps return to the diagonal to start the next iteration. This gives a useful numerical calculation even when solving explicitly is difficult. For the displayed law, every finite iteration is a lower bound for the eventual branching extinction probability; at generation six, about additional extinction probability remains beyond the current empty families.
Why the smallest fixed point? The ancestor's children's descendant families are independent; given children, all are empty generations later with probability . Averaging gives . The increasing extinction events give the limit , and continuity of the probability generating function yields . For any other fixed point , and monotonicity of imply at every step; hence . [ref]
https://www.uni-muenster.de/Stochastik/lehre/WS1011/SpezielleStochastischeProzesse/Ch_1.pdf. University of Münster branching-process notes, Section 1.4, Theorem 1.7
Galton-Watson process Created 2026-09-24 Updated 2026-10-13
A Galton-Watson process is a branching process that counts individuals by generation. Start with one ancestor, , and let all offspring counts be independent and identically distributed random variables taking nonnegative integer values with a common offspring distribution. ThenThe empty sum is zero: zero is an absorbing state, so once a generation is empty every later generation is empty. The same offspring distribution applies to every individual in every generation. [ref]
https://ocw.mit.edu/courses/18-445-introduction-to-stochastic-processes-spring-2015/27aaeb9eb9a9cecce93d9ad74413ddf5_MIT18_445S15_lecture19.pdf. Hao Wu, MIT 18.445, Lecture 19, slides 3–4
For a concrete offspring distribution, take , , , and for . An individual has no children with probability , one with probability , and two with probability . The offspring expected value is . A possible sequence of generation sizes is : two children need not lead to a permanently growing family.
The probability generating function gives the exact generation probability distributions through branching-process generating-function iteration. With and , the second generation hasThus and . The figure shows full generation probability mass functions, computed by polynomial function composition, through generation six; no simulated frequencies are used.
The contrast is striking: the expected generation size in a Galton-Watson process grows as , while the branching extinction probability is . By generation six, although . Larger surviving families carry the rising expected value; that mean is an average over possible families, not a forecast of one family's path. The Galton-Watson extinction fixed point turns an unbounded number of future generations into a single equation for this probability.
The historical question was the disappearance of surnames passed through male descendants. In Watson and Galton, On the Probability of the Extinction of Families, pages 139–140, Francis Galton formulates a constant-law model counting sons who reach adulthood, and Watson computes later generation probability distributions by composing generating functions. Those are assumptions of their model, rather than a claim that actual human reproduction follows this offspring distribution.

