Skip to content

Cumulant

Encode a probability law by the coefficients of the logarithm of its generating function, so independent sums become coefficientwise addition and joint cumulants isolate connected dependence.

Version
v4 · 2026-09-19 · History
Domain-specific #
1602
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Probability Theory → Mathematics
Aliases
Semi-invariant, Cumulant coefficient, Joint cumulant

Core Idea

A Cumulant is an order-indexed functional of a probability distribution obtained from the logarithm of a generating function. If the moment-generating function \(M_X(t)=\mathbb{E}[e^{tX}]\) exists in a neighborhood of zero, the cumulant-generating function is

\[ K_X(t)=\log M_X(t), \qquad \kappa_n(X)=K_X^{(n)}(0). \]

Thus \(K_X(t)=\sum_{n\ge1}\kappa_n t^n/n!\). The first cumulant is the mean, the second is the variance, and the third is the third central moment. Starting at order four, cumulants differ from central moments: for example, \(\kappa_4=\mu_4-3\mu_2^2\).

How would you explain it like I'm…

 

No faithful explanation at this level. All three generators agree that a five-year-old version can only say 'numbers for a pile's middle and spread', collapsing cumulants into ordinary moments or averages and losing the logarithm-of-generating-function definition and additivity under independence that make them distinct from fourth order on.

Adding-Up Shape Numbers

When something is random, like the total you roll with some dice, mathematicians describe it with a list of numbers. Cumulants are one special such list. The first one is the average, and the second one tells how spread out the results are. Their special power is this: if you add two random amounts that don't affect each other, each cumulant of the total is just the sum of the two cumulants. Many other ways of describing randomness don't add up that neatly.

Log-Generating-Function Coefficients

Cumulants are a sequence of numbers κ₁, κ₂, κ₃, … that describe a probability distribution. They come from taking the logarithm of the moment-generating function and reading off its coefficients. The first cumulant is the mean, the second is the variance, and the third equals the third central moment (a measure of lopsidedness). From the fourth on, cumulants are different from the ordinary moments: for example, κ₄ = μ₄ − 3μ₂². Their most useful property is that for independent random variables, cumulants add: κₙ(X + Y) = κₙ(X) + κₙ(Y), which works because the logarithm turns the product of generating functions into a sum.

 

A Cumulant κₙ is the n-th coefficient in the expansion of the cumulant-generating function K_X(t) = log M_X(t), where M_X(t) = E[e^{tX}] is the moment-generating function (assumed to exist near zero); equivalently κₙ = K_X^{(n)}(0), with K_X(t) = Σ κₙ tⁿ/n!. The first cumulant is the mean, the second is the variance, and the third is the third central moment. From order four on, cumulants differ from central moments; for instance κ₄ = μ₄ − 3μ₂². The logarithm is essential: for independent X and Y the generating functions multiply, so their logs add, giving κₙ(X + Y) = κₙ(X) + κₙ(Y). For several variables, joint cumulants are obtained by Möbius inversion over the lattice of set partitions, removing contributions that factor into independent blocks and keeping only the 'connected' part. Moments and cumulants can be converted into one another through sums over set partitions.

Scope of Application

In probability, cumulants organize sums of independent variables, limit theorems, and distributional approximations. Under normalization, higher-order cumulants often decay relative to variance, explaining how Gaussian structure emerges and enabling Edgeworth corrections around the central-limit approximation.

In statistics, low-order cumulants describe location, dispersion, asymmetry, and non-Gaussian tail/peak structure. Joint cumulants diagnose higher-order dependence beyond covariance. Sample cumulant estimators and polyspectra appear in signal processing and time-series analysis.

Clarity

There are three related levels: a distribution has population cumulants; a sample supplies estimators; and standardized shape coefficients are ratios built from cumulants. Reporting “the fourth cumulant” without units, existence conditions, or distinction from excess kurtosis invites error.

For a random variable scaled by (a), \(\kappa_n(aX)=a^n\kappa_n(X)\). For \(n\ge2\), adding a constant leaves the cumulant unchanged; the first cumulant shifts with location. These transformation rules provide quick dimensional checks.

Manages Complexity

Moments of a sum expand into many mixed terms. Cumulants collapse independent addition to one rule: add equal-order coefficients. The logarithm performs this compression once, and coefficient extraction propagates it to every order.

Partition inversion also sorts dependence by connected order. A raw joint moment includes products of lower-order associations; a joint cumulant subtracts every partitioned contribution. This is why diagrams, connected correlations, and cluster expansions naturally use cumulants.

Abstract Reasoning

To reason with cumulants:

  1. Specify the probability law and which moments or generating derivatives exist.
  2. Choose an analytic moment-generating definition, characteristic-function definition, or formal-series treatment and state the choice.
  3. Take the logarithm before extracting coefficients.
  4. Convert between moments and cumulants with the partition formulas when needed.
  5. Exploit translation, scaling, and independent-sum laws.
  6. For joint variables, test partitions into independent blocks and identify which connected orders remain.

Knowledge Transfer

The logarithm/coefficient/partition structure transfers literally among probability, statistics, combinatorics, statistical mechanics, and field theory. Probability laws may be replaced by partition functions or formal combinatorial classes, yet multiplicative composition becomes additive connected content through the same exponential formula.

The existing catalog’s Probability Distribution is the strict parent for this identity: cumulants are functionals that encode a law when they exist and under suitable determinacy conditions. Expected Value is the first member of the hierarchy; Statistical Independence is the condition that activates the simplest addition and vanishing laws.

Relationships to Other Abstractions

Local relationship map for CumulantParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.CumulantDOMAINDomain-specific abstraction: Probability Distribution — is a kind ofProbabilityDistributionDOMAIN

Current abstraction Cumulant Domain-specific

Parents (1) — outgoing typed relations

  • Cumulant is a kind of Probability Distribution Domain-specific

    Probability Distribution is the broader abstraction this entry instantiates.

Hierarchy paths (3) — routes to 2 parentless roots

Neighborhood in Abstraction Space

Cumulant sits in a sparse region of the domain-specific corpus (88th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Probability Transforms & Tail Behavior (7 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25