From formulasearchengine
Jump to navigation Jump to search

In probability theory and statistics, the cumulants κn of a probability distribution are a set of quantities that provide an alternative to the moments of the distribution. The moments determine the cumulants in the sense that any two probability distributions whose moments are identical will have identical cumulants as well, and similarly the cumulants determine the moments. In some cases theoretical treatments of problems in terms of cumulants are simpler than those using moments.

Just as for moments, where joint moments are used for collections of random variables, it is possible to define joint cumulants.


The cumulants Template:Mvar of a random variable X are defined via the cumulant-generating function g(t), which is the logarithm of the moment-generating function:

The cumulants Template:Mvar are obtained from a power series expansion of the cumulant generating function:

This expansion is a MacLaurin series so that nth cumulant can be obtained by differentiating the above expansion n times and evaluating the result at zero.

Uses in mathematical statistics

Working with cumulants can have an advantage over using moments because for statistically independent random variables X and Y,

so that each cumulant of a sum of random variables is the sum of the corresponding cumulants of the addends. A related result is that a cumulant generating function for a product of random variables (defined as a random sum of independent realizations) is the composition of the respective cumulant generating functions.[1]

A distribution with given cumulants Template:Mvar can be approximated through an Edgeworth series.

Cumulants of some discrete probability distributions

  • The constant random variable X = 1. The derivative of the cumulant generating function is g′(t) = 1. The first cumulant is κ1 = g '(0) = 1 and the other cumulants are zero, κ2 = κ3 = κ4 = ... = 0.
  • The constant random variables X = μ. Every cumulant is just μ times the corresponding cumulant of the constant random variable X = 1. The derivative of the cumulant generating function is g′(t) = μ. The first cumulant is κ1 = g '(0) = μ and the other cumulants are zero, κ2 = κ3 = κ4 = ... = 0. So the derivative of cumulant generating functions is a generalization of the real constants.
  • The Bernoulli distributions, (number of successes in one trial with probability p of success). The special case p = 1 is the constant random variable X = 1. The derivative of the cumulant generating function is g′(t) = ((p−1 − 1) et + 1)−1. The first cumulants are κ1 = g '(0) = p and κ2 = g′′(0) = p·(1 − p). The cumulants satisfy a recursion formula
  • The geometric distributions, (number of failures before one success with probability p of success on each trial). The derivative of the cumulant generating function is g′(t) = ((1 − p)−1et−1)−1. The first cumulants are κ1 = g′(0) = p−1 − 1, and κ2 = g′′(0) = κ1p−1. Substituting p = (μ + 1)−1 gives g′(t) = ((μ−1 + 1)et − 1)−1 and κ1 = μ.
  • The Poisson distributions. The derivative of the cumulant generating function is g′(t) = μet. All cumulants are equal to the parameter: κ1 = κ2 = κ3 = ... = μ.
  • The binomial distributions, (number of successes in n independent trials with probability p of success on each trial). The special case n = 1 is a Bernoulli distribution. Every cumulant is just n times the corresponding cumulant of the corresponding Bernoulli distribution. The derivative of the cumulant generating function is g′(t) = n((p−1 − 1)et + 1)−1. The first cumulants are κ1 = g′(0) = np and κ2 = g′′(0) = κ1(1 − p). Substituting p = μ·n−1 gives g '(t) = ((μ−1n−1)·et + n−1)−1 and κ1 = μ. The limiting case n−1 = 0 is a Poisson distribution.
  • The negative binomial distributions, (number of failures before n successes with probability p of success on each trial). The special case n = 1 is a geometric distribution. Every cumulant is just n times the corresponding cumulant of the corresponding geometric distribution. The derivative of the cumulant generating function is g '(t) = n·((1−p)−1·et−1)−1. The first cumulants are κ1 = g '(0) = n·(p−1−1), and κ2 = g ' '(0) = κ1·p−1. Substituting p = (μ·n−1+1)−1 gives g′(t) = ((μ−1 + n−1)etn−1)−1 and κ1 = μ. Comparing these formulas to those of the binomial distributions explains the name 'negative binomial distribution'. The limiting case n−1 = 0 is a Poisson distribution.

Introducing the variance-to-mean ratio

the above probability distributions get a unified formula for the derivative of the cumulant generating function:{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

The second derivative is

confirming that the first cumulant is κ1 = g′(0) = μ and the second cumulant is κ2 = g′′(0) = με. The constant random variables X = μ have ε = 0. The binomial distributions have ε = 1 − p so that 0 < ε < 1. The Poisson distributions have ε = 1. The negative binomial distributions have ε = p−1 so that ε > 1. Note the analogy to the classification of conic sections by eccentricity: circles ε = 0, ellipses 0 < ε < 1, parabolas ε = 1, hyperbolas ε > 1.

Cumulants of some continuous probability distributions

  • For the normal distribution with expected value μ and variance σ2, the cumulant generating function is g(t) = μt + σ2t2/2. The first and second derivatives of the cumulant generating function are g '(t) = μ + σ2·t and g"(t) = σ2. The cumulants are κ1 = μ, κ2 = σ2, and κ3 = κ4 = ... = 0. The special case σ2 = 0 is a constant random variable X = μ.

Some properties of the cumulant generating function

The cumulant generating function g(t), if it exists, is infinitely differentiable and convex, and passes through the origin. Its first derivative ranges monotonically in the open interval from the infimum to the supremum of the support of the probability distribution, and its second derivative is strictly positive everywhere it is defined, except for the degenerate distribution of a single point mass. The cumulant-generating function exists if and only if the tails of the distribution are majorized by an exponential decay, that is, (see Big O notation,)


where is the cumulative distribution function. The cumulant-generating function will have vertical asymptote(s) at the infimum of such c, if such an infimum exists, and at the supremum of such d, if such a supremum exists, otherwise it will be defined for all real numbers.

If the support of a random variable X has finite upper or lower bounds, then its cumulant-generating function y=g(t), if it exists, approaches asymptote(s) whose slope is equal to the supremum and/or infimum of the support,


respectively, lying above both these lines everywhere. (The integrals

yield the y-intercepts of these asymptotes, since g(0)=0.)

For a shift of the distribution by k, For a degenerate point mass at k, the cgf is the straight line , and more generally, if and only if X and Y are independent and their cgfs exist; (subindependence and the existence of second moments sufficing to imply independence.[2])

The natural exponential family of a distribution may be realized by shifting or translating g(t), and adjusting it vertically so that it always passes through the origin: if f is the pdf with cgf and is its natural exponential family, then and

If g(t) is finite for a range t1 < Re(t) < t2 then if t1 < 0 < t2 then g(t) is analytic and infinitely differentiable for t1 < Re(t) < t2. Moreover for t real and t1 < t < t2 g(t) is strictly convex, and g'(t) is strictly increasing. {{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

Some properties of cumulants

Invariance and equivariance

The first cumulant is shift-equivariant; all of the others are shift-invariant. This means that, if we denote by κn(X) the nth cumulant of the probability distribution of the random variable X, then for any constant c:

In other words, shifting a random variable (adding c) shifts the first cumulant (the mean) and doesn't affect any of the others.


The nth cumulant is homogeneous of degree n, i.e. if c is any constant, then


If X and Y are independent random variables then κn(X + Y) = κn(X) + κn(Y).

A negative result

Given the results for the cumulants of the normal distribution, it might be hoped to find families of distributions for which κm = κm+1 = ... = 0 for some m > 3, with the lower-order cumulants (orders 3 to m − 1) being non-zero. There are no such distributions.[3] The underlying result here is that the cumulant generating function cannot be a finite-order polynomial of degree greater than 2.

Cumulants and moments

The moment generating function is:

So the cumulant generating function is the logarithm of the moment generating function. The first cumulant is the expected value; the second and third cumulants are respectively the second and third central moments (the second central moment is the variance); but the higher cumulants are neither moments nor central moments, but rather more complicated polynomial functions of the moments.

The cumulants are related to the moments by the following recursion formula:

The nth moment μ′n is an nth-degree polynomial in the first n cumulants:

The coefficients are precisely those that occur in Faà di Bruno's formula.

The "prime" distinguishes the moments μ′n from the central moments μn. To express the central moments as functions of the cumulants, just drop from these polynomials all terms in which κ1 appears as a factor:

Likewise, the nth cumulant κn is an nth-degree polynomial in the first n non-central moments:

To express the cumulants κn for n > 1 as functions of the central moments, drop from these polynomials all terms in which μ'1 appears as a factor:

To express the cumulants κn for n > 2 as functions of the standardized central moments, also set μ'2=1 in the polynomials:

Relation to moment-generating function

Using the (non-central) moments μ′n = E(X n) of X and the moment-generating function,

With a formal power series logarithm:

The cumulants of a distribution are closely related to the distribution's moments. For example, if a random variable X admits an expected value μ = E(X) and a variance σ2 = E((X − μ)2), then these are the first two cumulants: μ = κ1 and σ2 = κ2.

Generally, the cumulants can be extracted from the cumulant-generating function via differentiation (at zero) of g(t). That is, the cumulants appear as the coefficients in the Maclaurin series of g(t):

Note that expectation values are sometimes denoted by angle brackets, e.g.,

and cumulants can be denoted by angle brackets with the subscript c,[4] e.g.,

Some writers[5][6] prefer to define the cumulant generating function as the natural logarithm of the characteristic function, which is sometimes also called the second characteristic function,[7][8]

The advantage of h(t)—in some sense the function g(t) evaluated for (purely) imaginary arguments—is that E(eitX) will be well defined for all real values of t even when E(etX) is not well defined for all real values of t, such as can occur when there is "too much" probability that X has a large magnitude. Although h(t) will be well defined, it nonetheless may mimic g(t) by not having a Maclaurin series beyond (or, rarely, even to) linear order in the argument t. Thus, many cumulants may still not be well defined. Nevertheless, even when h(t) does not have a long Maclaurin series it can be used directly in analyzing and, particularly, adding random variables. Both the Cauchy distribution (also called the Lorentzian) and stable distribution (related to the Lévy distribution) are examples of distributions for which the power-series expansions of the generating functions have only finitely many well-defined terms.

Cumulants and set-partitions

These polynomials have a remarkable combinatorial interpretation: the coefficients count certain partitions of sets. A general form of these polynomials is


  • π runs through the list of all partitions of a set of size n;
  • "B ∈ π" means B is one of the "blocks" into which the set is partitioned; and
  • |B| is the size of the set B.

Thus each monomial is a constant times a product of cumulants in which the sum of the indices is n (e.g., in the term κ3 κ22 κ1, the sum of the indices is 3 + 2 + 2 + 1 = 8; this appears in the polynomial that expresses the 8th moment as a function of the first eight cumulants). A partition of the integer n corresponds to each term. The coefficient in each term is the number of partitions of a set of n members that collapse to that partition of the integer n when the members of the set become indistinguishable.

Cumulants and combinatorics

Further connection between cumulants and combinatorics can be found in the work of Gian-Carlo Rota and Jianhong (Jackie) Shen, where links to invariant theory, symmetric functions, and binomial sequences are studied via umbral calculus.[9]

Joint cumulants

The joint cumulant of several random variables X1, ..., Xn is defined by a similar cumulant generating function

A consequence is that

where π runs through the list of all partitions of { 1, ..., n }, B runs through the list of all blocks of the partition π, and |π| is the number of parts in the partition. For example,

If any of these random variables are identical, e.g. if X = Y, then the same formulae apply, e.g.

although for such repeated variables there are more concise formulae. For zero-mean random vectors,

The joint cumulant of just one random variable is its expected value, and that of two random variables is their covariance. If some of the random variables are independent of all of the others, then any cumulant involving two (or more) independent random variables is zero. If all n random variables are the same, then the joint cumulant is the nth ordinary cumulant.

The combinatorial meaning of the expression of moments in terms of cumulants is easier to understand than that of cumulants in terms of moments:

For example:

Another important property of joint cumulants is multilinearity:

Just as the second cumulant is the variance, the joint cumulant of just two random variables is the covariance. The familiar identity

generalizes to cumulants:

Conditional cumulants and the law of total cumulance

{{#invoke:main|main}} The law of total expectation and the law of total variance generalize naturally to conditional cumulants. The case n = 3, expressed in the language of (central) moments rather than that of cumulants, says

In general,[10]


  • the sum is over all partitions π of the set { 1, ..., n } of indices, and
  • π1, ..., πb are all of the "blocks" of the partition π; the expression κ(Xπm) indicates that the joint cumulant of the random variables whose indices are in that block of the partition.

Relation to statistical physics

In statistical physics many extensive quantities – that is quantities that are proportional to the volume or size of a given system – are related to cumulants of random variables. The deep connection is that in a large system an extensive quantity like the energy or number of particles can be thought of as the sum of (say) the energy associated with a number of nearly independent regions. The fact that the cumulants of these nearly independent random variables will (nearly) add make it reasonable that extensive quantities should be expected to be related to cumulants.

A system in equilibrium with a thermal bath at temperature T can occupy states of energy E. The energy E can be considered a random variable, having the probability density. The partition function of the system is

where β = 1/(kT) and k is Boltzmann's constant and the notation has been used rather than for the expectation value to avoid confusion with the energy, E. The Helmholtz free energy is then

and is clearly very closely related to the cumulant generating function for the energy. The free energy gives access to all of the thermodynamics properties of the system via its first second and higher order derivatives, such as its internal energy, entropy, and specific heat. Because of the relationship between the free energy and the cumulant generating function, all these quantities are related to cumulants e.g. the energy and specific heat are given by

and symbolizes the second cumulant of the energy. Other free energy is often also a function of other variables such as the magnetic field or chemical potential , e.g.

where N is the number of particles and is the grand potential. Again the close relationship between the definition of the free energy and the cumulant generating function implies that various derivatives of this free energy can be written in terms of joint cumulants of E and N.


The history of cumulants is discussed by Anders Hald.[11][12]

Cumulants were first introduced by Thorvald N. Thiele, in 1889, who called them semi-invariants.[13] They were first called cumulants in a 1932 paper[14] by Ronald Fisher and John Wishart. Fisher was publicly reminded of Thiele's work by Neyman, who also notes previous published citations of Thiele brought to Fisher's attention.[15] Stephen Stigler has said{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} that the name cumulant was suggested to Fisher in a letter from Harold Hotelling. In a paper published in 1929,{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} Fisher had called them cumulative moment functions. The partition function in statistical physics was introduced by Josiah Willard Gibbs in 1901.{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} The free energy is often called Gibbs free energy. In statistical mechanics, cumulants are also known as Ursell functions relating to a publication in 1927.{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

Cumulants in generalized settings

Formal cumulants

More generally, the cumulants of a sequence { mn : n = 1, 2, 3, ... }, not necessarily the moments of any probability distribution, are, by definition,

where the values of κn for n = 1, 2, 3, ... are found formally, i.e., by algebra alone, in disregard of questions of whether any series converges. All of the difficulties of the "problem of cumulants" are absent when one works formally. The simplest example is that the second cumulant of a probability distribution must always be nonnegative, and is zero only if all of the higher cumulants are zero. Formal cumulants are subject to no such constraints.

Bell numbers

In combinatorics, the nth Bell number is the number of partitions of a set of size n. All of the cumulants of the sequence of Bell numbers are equal to 1. The Bell numbers are the moments of the Poisson distribution with expected value 1.

Cumulants of a polynomial sequence of binomial type

For any sequence { κn : n = 1, 2, 3, ... } of scalars in a field of characteristic zero, being considered formal cumulants, there is a corresponding sequence { μ ′ : n = 1, 2, 3, ... } of formal moments, given by the polynomials above.Template:Clarify{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} For those polynomials, construct a polynomial sequence in the following way. Out of the polynomial

make a new polynomial in these plus one additional variable x:

and then generalize the pattern. The pattern is that the numbers of blocks in the aforementioned partitions are the exponents on x. Each coefficient is a polynomial in the cumulants; these are the Bell polynomials, named after Eric Temple Bell.{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

This sequence of polynomials is of binomial type. In fact, no other sequences of binomial type exist; every polynomial sequence of binomial type is completely determined by its sequence of formal cumulants.{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

Free cumulants

In the identityTemplate:Clarify

one sums over all partitions of the set { 1, ..., n }. If instead, one sums only over the noncrossing partitions, then one gets "free cumulants" rather than conventional cumulants treated above.Template:Clarify These play a central role in free probability theory.[16] In that theory, rather than considering independence of random variables, defined in terms of Cartesian products of algebras of random variables, one considers instead "freeness" of random variables, defined in terms of free products of algebras rather than Cartesian products of algebras.{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }}

The ordinary cumulants of degree higher than 2 of the normal distribution are zero. The free cumulants of degree higher than 2 of the Wigner semicircle distribution are zero.[16] This is one respect in which the role of the Wigner distribution in free probability theory is analogous to that of the normal distribution in conventional probability theory.

See also

{{ safesubst:#invoke:Unsubst||$N=Refimprove |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }} Template:More footnotes


  2. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  3. Lukacs, E. (1970) Characteristic Functions (2nd Edition), Griffin, London. (Theorem 7.3.5)
  4. Kubo, R., Toda, M. and Hashitsume, N. (1998) Statistical Physics II: Nonequilibrium Statistical Mechanics (2nd Edition). Springer. (Page 12)
  5. Kendall, M.G., Stuart, A. (1969) The Advanced Theory of Statistics, Volume 1 (3rd Edition). Griffin, London. (Section 3.12)
  6. Lukacs, E. (1970) Characteristic Functions (2nd Edition). Griffin, London. (Page 27)
  7. Lukacs, E. (1970) Characteristic Functions (2nd Edition). Griffin, London. (Section 2.4)
  8. Aapo Hyvarinen, Juha Karhunen, and Erkki Oja (2001) Independent Component Analysis, John Wiley & Sons. (Section 2.7.2)
  9. G.-C. Rota and J. Shen, "On the Combinatorics of Cumulants", Journal of Combinatorial Theory, Series A, 91:283–304, 2000.
  10. Brillinger, D.R. (1969) "The Calculation of Cumulants via Conditioning", Annals of the Institute of Statistical Mathematics, 21, 215–218
  11. Hald, A. (2000) "The early history of the cumulants and the Gram–Charlier series" International Statistical Review, 68 (2): 137–153. (Reprinted in {{#invoke:citation/CS1|citation |CitationClass=book }})
  12. {{#invoke:citation/CS1|citation |CitationClass=book }}
  13. H. Cramér (1946) Mathematical Methods of Statistics, Princeton University Press, Section 15.10, p. 186.
  14. Fisher, R.A. , John Wishart, J.. (1932) The derivation of the pattern formulae of two-way partitions from those of simpler patterns, Proceedings of the London Mathematical Society, Series 2, v. 33, pp. 195–208 Template:Hide in printTemplate:Only in print
  15. Neyman, J. (1956): ‘Note on an Article by Sir Ronald Fisher,’ Journal of the Royal Statistical Society, Series B (Methodological), 18, pp. 288–94.
  16. 16.0 16.1 {{#invoke:Citation/CS1|citation |CitationClass=journal }}

External links

Template:Theory of probability distributions