Cumulants and the Linked-Cluster Connection
Two problems that look nothing alike turn out to run on the same engine. In probability, you describe a random variable through its moments — but the moments mix genuine information with trivial bookkeeping, so the sharper description uses cumulants, the Taylor coefficients of . In statistical mechanics, you describe an interacting gas through its partition function, a sum over every configuration — but the physically clean object is , which keeps only the connected clusters of particles. These are not two analogies. They are the same theorem, and this article proves the identity: a cumulant is a connected correlation, and a connected cluster is a cumulant. The bridge is the combinatorics of set partitions. A moment of order is a sum over every way to partition points into blocks, with each block contributing a cumulant; a partition function is a sum over every way to group particles into clusters, with each cluster contributing a connected integral. In both cases a generic object factorizes into independent connected pieces, and summing over how many of each piece appear rebuilds an exponential. That single fact — the exponential formula, — is why the logarithm extracts connectivity in one language and cumulants in the other. The payoff is structural and physical. It is why is extensive (each connected cluster is local, so the sum scales with volume), why free energies are sums of connected diagrams (disconnected vacuum bubbles cancel), and why a Gaussian has no cumulants beyond the second (Wick's theorem: nothing is irreducibly connected past a pair). The Mayer cluster expansion, the virial series, the cumulant expansion of perturbation theory, and the linked-cluster theorem of many-body physics are one identity in four costumes — and this article is where they meet.
- The cumulant generating function has Taylor coefficients ; taking the logarithm is exactly the operation that strips away disconnected contributions.
- A moment is a sum over all set partitions of products of cumulants (); the cumulant is the single-block, connected piece — the inversion runs on the partition lattice.
- The exponential formula turns a sum over all graphs into the exponential of a sum over connected graphs, mirroring .
- Applied to the grand partition function this is the linked-cluster theorem, : the Mayer cluster integrals are the cumulants of the fugacity expansion.
- Cumulants add for independent parts and vanish beyond second order for Gaussians, which is why they are the natural language for fluctuations, response functions, and diagrammatic perturbation theory.
- Key idea: taking the logarithm of a generating function keeps only connected pieces. Cumulants are connected moments and connected clusters are cumulants; the exponential formula is the one theorem behind the cumulant expansion, the Mayer cluster expansion, and the connected-diagram rule of field theory.
Taking the logarithm of a generating function is the same operation as keeping only connected pieces: cumulants are connected moments, and connected clusters are cumulants. The exponential formula unifies the moment–cumulant relation, the Mayer cluster expansion, and the connected-diagram rule of quantum field theory.
Where this lives today
The connected-piece theorem is the quiet workhorse of quantitative many-body physics. Coupled-cluster theory — the most accurate routinely used method in quantum chemistry, and the reason molecular energies can be computed to chemical accuracy — is built on the exponential ansatz , whose name and structure descend directly from Mayer's clusters: the exponential automatically resums the disconnected excitations, leaving only the connected amplitudes to be solved for. In condensed matter and field theory, the generating functional of connected Green's functions, , is the object from which every physical correlation is built, precisely because the logarithm discards disconnected vacuum factors. Cumulants have also become a direct experimental probe. In heavy-ion collisions, event-by-event cumulants of the net-proton number — the third and fourth in particular — are measured as signatures of the QCD critical point, where higher cumulants are predicted to diverge faster than lower ones and can even change sign; the same -of-generating-function structure that defines a virial coefficient defines these fluctuation observables. In quantum transport, "full counting statistics" characterizes a current not by its mean alone but by the cumulants of the transferred charge, whose generating function is again a logarithm. Wherever a system's fluctuations, not just its averages, carry the physics, the connected structure of this article is doing the work.
The physical picture
Picture a configuration of an interacting gas as a graph: each particle is a vertex, and a Mayer bond is drawn wherever two particles are close enough to interact. A typical configuration splits into several disconnected blobs that do not know about one another — the integral over the whole graph factorizes into a product over its connected pieces. Summing over all graphs gives the partition function ; but because the blobs factorize, that sum is the exponential of the sum over a single connected blob. The logarithm then undoes the exponential and leaves only connected blobs. That is the linked-cluster theorem, and it is the reason counts connected clusters and nothing else. The probabilistic mirror is exact. Write for a quantity built from many independent contributions. Moments mix everything, including products of independent pieces; but is additive over independent variables, so it can only retain genuinely joint — that is, connected — information. Cumulants of a sum of independent variables add, and cross-cumulants between independent variables vanish. "Additive under " and "connected under graph-summation" are the same statement, and the figure below makes the dictionary explicit: cumulants, gas clusters, and Feynman diagrams are one connected structure wearing three costumes.
A useful slogan: the moment of a product is a sum over all pairings and partitions; the cumulant is the part that cannot be factored. For a Gaussian, every higher moment is exactly the sum over pairings — Wick's theorem — so every cumulant beyond the second vanishes: there is nothing irreducibly connected past the two-point function. The next figure shows the smallest nontrivial case, : one connected four-point piece, plus three disconnected pairings that the logarithm removes. Reading a moment "minus its disconnected pieces" is exactly reading a cumulant.
Extensivity now comes for free. A connected cluster of particles, after one center-of-mass integration, contributes a volume-independent number times a single factor of . So , while grows like . Extensivity, connectivity, and the logarithm are three names for one thing.
The core equations
The starting point is the pair of generating functions. The moment generating function packages every moment; its logarithm packages the cumulants, and equating Taylor coefficients turns cumulants into explicit polynomials in the moments.
where: — moment generating function; — cumulant generating function, its logarithm; — the -th moment (with ); — the -th cumulant. The single operation "" is what converts the moment ladder into the cumulant ladder — everything in this article is a consequence of that one step. Reading off the low-order coefficients gives the cumulants as moment polynomials. The first is the mean, the second the variance; the third is the third central moment, but the fourth is not the fourth central moment.
where: — variance; — skewness numerator; — excess-kurtosis numerator. For a centered variable () these reduce to , , and crucially — the subtracts the Gaussian (disconnected-pairing) baseline, so measures departure from Gaussianity. The inverse relation is the combinatorial heart of the whole subject: a moment is a sum over every way to partition its indices into blocks, each block contributing one cumulant. The cumulant is the single-block ("connected") term of the moment.
where: — the set of partitions of (there are of them, the Bell numbers ); — a partition into blocks ; — number of blocks. The first identity is the exponential formula in disguise; the second is Möbius inversion on the partition lattice, with the alternating signs that pick out connectivity. The same algebra applied to the grand partition function is the linked-cluster theorem. Summing over particle number exponentiates the disconnected configurations, so the logarithm keeps only connected clusters — the cluster integrals play the role of the cumulants.
where: — fugacity; — the -particle configuration integral (owned by aq-sm-configuration-integral); — the -th cluster integral (owned by aq-sm-mayer-cluster-expansion), the connected -cluster per unit volume; — volume. Compare (4) with (1): , , . The linked-cluster theorem is the moment–cumulant relation for the fugacity expansion. The identification is literal: the cluster integral is a cumulant of the interaction, computed in the ideal-gas measure. Writing and taking the log gives the cumulant series of .
where: — average over the non-interacting configuration measure; — the connected (cumulant) average of the total interaction energy. Re-expressing with converts these energy cumulants into connected -bond graphs, recovering the . Cluster integrals are cumulants; the linked-cluster theorem is the cumulant theorem in disguise.
The goal is to establish the master combinatorial identity, , and to check it explicitly for so that "the cumulant is the connected piece of the moment" becomes a precise, verifiable statement rather than a slogan. The strategy is to take the definition , expand the exponential of the cumulant sum, and organize the resulting terms by which cumulants appear at each order — the organizing principle turns out to be exactly the set partitions of the index set. The subtlety to watch is the counting of identical blocks: the symmetry factors of the exponential are precisely what makes the raw expansion collapse into a clean sum over distinct partitions, with each partition counted once.
Step 1. Exponentiate the cumulant sum. From with , write . Why: the exponential of a sum is the product of exponentials, and each factor is a Taylor series in the number of size- blocks that will appear.
Step 2. Collect the coefficient of . A term has total degree ; its coefficient of is . That multinomial factor is exactly the number of set partitions of with blocks of size . Why: choosing which of the labelled points fall into each block, then dividing by the internal orderings and the interchange of identical blocks , is the standard count of partitions of a given block-type.
Step 3. Sum over block types. Summing over all with therefore reproduces , one term per partition . Why: every partition of the index set arises exactly once, and its weight is the product of one cumulant per block — the exponential formula for exponential generating functions.
Step 4. Read the low orders. For : partitions and give . For : (one 3-block, three ways to split , one all-singletons). For : , the partitions grouped by type. Why: inverting these gives (2); in particular the "" in counts the three pairings of four points — the disconnected pieces the logarithm removes. *Verified: the partition-sum formulas for are checked against the direct cumulant inversion by enumerating all set partitions, and the Bell counts confirmed, in verify_cumulants-linked-cluster.py.*
Go deeper · Derivation B · 2 minThe exponential formula: all pieces = exp of connected pieces, and its Mayer face
The goal here is to prove the exponential (linked-cluster) formula, , and to show it is the same identity as , so that applying it to the grand partition function yields with the cluster integrals in the role of cumulants. The route is to observe that any labelled graph is a disjoint union of connected components, count the ways to assemble a graph from a given inventory of connected pieces, and recognize the resulting sum as an exponential. The point to watch is that "connected" here means what it does for cumulants — a single block — so the Mayer , the joint cumulants, and the connected diagrams are literally the same objects in different weights.
Step 1. Decompose a graph into connected components. A graph on labelled vertices is fixed by a partition of the vertices into blocks and a connected graph on each block; let denote the sum (integral) over connected graphs on labelled vertices. Why: connectivity partitions the vertex set uniquely, so summing over graphs = summing over partitions and, within each block, over connected structures.
Step 2. Count assemblies with symmetry factors. A configuration with connected pieces of size (so ) contributes after dividing by the interchange of identical pieces. Why: handles the labels inside each connected block and avoids double-counting identical blocks — exactly the symmetry factors of Step 2 in the previous card.
Step 3. Resum into an exponential. Summing freely over all , . Why: each factor is the Taylor series of an exponential; the product over sizes collapses to a single exponential of the connected sum — the exponential formula, identical in form to .
Step 4. Take the log and read the Mayer face. Therefore — connected pieces only. Applied to with the fugacity weight, this is , so is the connected -cluster: the -th cumulant of the fugacity expansion. Why: the logarithm inverts the exponential of connected pieces, discarding every disconnected product; the same log that turns moments into cumulants turns the grand partition function into the connected-cluster series (owned in full by aq-sm-mayer-cluster-expansion). *Verified: the exp/log inverse , the reproduction of the disconnected term as (equivalently ), and the Mayer form are checked symbolically in verify_cumulants-linked-cluster.py.*
Limiting cases
The correspondence specializes cleanly, and each limit sharpens the meaning of "connected."
| Case | Result | Meaning |
|---|---|---|
| Gaussian / ideal | ; | Only the two-point cumulant survives (Wick's theorem); with no bonds, no clusters, so (ideal gas). |
| Independent parts | Cumulants add; equivalently of non-interacting subsystems is a sum — no connected cluster spans independent parts. | |
| Poisson | for all | Every cumulant equals the rate; a "maximally connected" ladder — the diagrammatic opposite of the Gaussian. |
| Low density | The first nontrivial cumulant of the Mayer bond gives , hence , the leading virial coefficient. | |
| Large deviations | The scaled cumulant generating function is the Legendre dual of the rate function — the same -of-MGF structure governs rare events. |
Worked examples
1 · The fourth moment of an exponential variable (confidence builder)
We verify concretely for (mean ), where the cumulants are known exactly, to see the connected and disconnected pieces separate.
Step 1. For the cumulant generating function is , so . Thus , , , and .
Step 2. Assemble the fourth moment from the partition sum: .
Step 3. Add the pieces: . Directly, for — they agree. The connected part is ; the term is the three disconnected pairings that the logarithm removes.
Step 4. The centered fourth cumulant is . Here and (fourth central moment of ), giving — matching Step 1. The subtraction is exactly the disconnected-pairing removal, in central-moment language.
2 · Cumulant additivity versus moment non-additivity (exam level)
We show that the fourth cumulant of a sum of independent variables is additive while the fourth central moment is not — the operational signature that cumulants are connected.
Step 1. Let with independent . By additivity of cumulants, , and this scales linearly with the number of terms.
Step 2. The fourth central moment does not add. Using with , , : .
Step 3. Check consistency: with , so — matching Step 1. The extra central-moment pieces are precisely the disconnected pairings across distinct variables, which cancel in the cumulant.
Step 4. The physical reading: is why intensive cumulants (per particle) are finite and extensive quantities have well-behaved fluctuations, while raw central moments grow faster and mix connected and disconnected information. A Monte-Carlo check of samples reproduces and , confirming the split numerically.
Origins · 1 mincumulant generating function and how this was discovered
The cumulant generating function is the logarithm of the moment generating function, , and its power-series coefficients are the cumulants that this article's whole apparatus is built on. Taking the logarithm is precisely the operation that strips the disconnected (product) structure out of the moments and leaves the connected pieces, which is why the linked-cluster theorem, Mayer's , and the connected-diagram rule of field theory are all the same identity viewed through this one function. Its probabilistic seed is Thiele's 1889 "half-invariants" — what we now call cumulants — and its statistical-mechanical incarnation is the free energy itself: is a cumulant generating function in the coupling, so the mean energy is (first cumulant), the heat capacity is the energy variance (second cumulant), and higher response functions are higher cumulants. The additivity for independent variables is nothing but extensivity of for independent subsystems — the same reason free energies add while partition functions multiply. In every guise the content is one identity: the log of a generating function keeps only the connected content, so cumulants, Mayer clusters, and connected Feynman diagrams are the same mathematics wearing different physical costumes.
Going further
Texts. Kardar, Statistical Physics of Particles, Ch. 2 (cumulants) and Ch. 5–6 (cluster expansion). Pathria & Beale, Statistical Mechanics, 3rd ed., Ch. 9–10 (cluster expansion, linked clusters). Sethna, Statistical Mechanics: Entropy, Order Parameters, and Complexity, Ch. 6 and the cumulant exercises. Landau & Lifshitz, Statistical Physics Part 1, §§74–76. Negele & Orland, Quantum Many-Particle Systems (the linked-cluster theorem and connected diagrams).
Provenance. Base article: AllQFT track `sm`, "Cumulants and the Linked-Cluster Connection" (STAT.INTER.CUMLC.1260); source Pathria & Beale, Statistical Mechanics, 3rd ed., Ch. 9–10, and Kardar Ch. 2, 6. All symbolic and numeric claims re-verified here in verify_cumulants-linked-cluster.py (the low-order cumulants from ; the moment = sum-over-set-partitions identity for with Bell counts ; the exp-of-connected inverse and the disconnected term; Gaussian and Poisson ; cumulant additivity of a sum with a Monte-Carlo cross-check; the Mayer form); no base physics error found.
Prerequisites. Configuration Integral and the Interacting Partition Function · The Mayer f-Function · Mayer Cluster Expansion · Cluster Integrals and Their Combinatorics.
Leads to. Linked-Cluster Theorem · Irreducible Cluster Integrals and the Virial Series · Virial Expansion of the Equation of State · Second Virial Coefficient.
Cumulant, cluster, connected diagram — are these literally the same object, or just analogous?
Literally the same, once you fix the weights. In all three cases you have a generating function that sums over "everything," and its logarithm keeps only the connected part. For a random variable, "everything" is the moments and the connected part is the cumulants. For a gas, "everything" is all Mayer graphs and the connected part is the cluster integrals . In field theory, "everything" is all Feynman diagrams and the connected part is the connected diagrams. The combinatorics — sum over set partitions, with the exponential formula relating the full sum to the connected sum — is identical. Only the objects living on the vertices and edges differ (numbers, -bonds, propagators). That is why the coupled-cluster method in chemistry carries "cluster" in its name: it is Mayer's theorem applied to electronic wavefunctions.
Why does taking a logarithm remove disconnected pieces? It still feels like a trick.
It is a consequence of one fact: independent things multiply, and the logarithm turns products into sums. A disconnected configuration is a product of its independent connected pieces. When you sum over how many copies of each connected piece can appear, you are summing a Taylor series that reassembles an exponential — so the full generating function is . The logarithm simply inverts that exponential and returns the single connected sum. Nothing is thrown away by hand; the disconnected terms were never independent data, they were just repeated products of the connected ones, and the exponential is the bookkeeping device that packages such repetition.
Is the fourth cumulant the same as the fourth central moment?
No, and this trips up many people. The third cumulant does equal the third central moment, . But the fourth cumulant is — the fourth central moment minus three times the variance squared. The subtraction removes the "Gaussian baseline": a Gaussian has exactly, so its . The fourth cumulant therefore measures excess kurtosis, how far the tails depart from Gaussian, whereas the fourth central moment does not vanish even for a Gaussian. The general rule: cumulants equal central moments only up to third order.
How does this connect to the extensivity of the free energy?
Directly. The free energy is , and is a sum over connected clusters by the linked-cluster theorem. Each connected cluster is a local object: after one center-of-mass integration it contributes a volume-independent number times a single factor of . So , hence — extensivity. If had kept disconnected clusters, you would get terms scaling like and worse, and the free energy per particle would not have a thermodynamic limit. Extensivity is not an assumption here; it is a theorem, and its proof is exactly "only connected clusters contribute to ."
Where do the alternating signs and factorials in the cumulant-from-moments formula come from?
They are the Möbius function of the partition lattice. When you invert " sum over partitions of products of cumulants" to solve for , you are performing Möbius inversion on the poset of set partitions ordered by refinement. The Möbius function of that lattice is for a partition into blocks — precisely the coefficient in . So the signs and factorials are not arbitrary; they are the inverse, on the partition lattice, of the plain sum-over-partitions that builds the moments.
Does the connected-cluster structure survive for quantum systems, or is it classical only?
It survives, and in fact becomes even more central. For quantum gases the configuration integrals are replaced by traces over symmetrized/antisymmetrized states, and the same exponential formula gives the quantum cluster (Kahn–Uhlenbeck) expansion, with connected clusters now carrying exchange as well as interaction. In quantum field theory the theorem is foundational: the generating functional produces connected correlation functions, and the effective action (its Legendre transform) produces one-particle-irreducible ones — two successive reductions exactly parallel to "connected" then "irreducible" in the classical virial story. The logarithm-keeps-connected principle is one of the few statements that reads identically from a dilute classical gas to interacting quantum fields.