Math 2.0

Statistical mechanics, structure of matter Definition

Cavity method

Builds on GraphProbability measureGibbs measure

Definition

Let G=(V,E)G = (V, E) be a finite graph, and let ๐’ณ\mathcal{X} be a finite set. For each edge {i,j}โˆˆE\set{i, j} \in E, let ฯˆijโ€‰โฃ:๐’ณร—๐’ณโ†’(0,โˆž)\psi_{ij} \colon \mathcal{X} \times \mathcal{X} \to (0, \infty). For each vertex iโˆˆVi \in V, let ฯ•iโ€‰โฃ:๐’ณโ†’(0,โˆž)\phi_i \colon \mathcal{X} \to (0, \infty). Let ฮผ\mu be the Gibbs measure on ๐’ณV\mathcal{X}^V with ฮผ(x)โˆโˆ{i,j}โˆˆEฯˆij(xi,xj)โˆiโˆˆVฯ•i(xi)\mu(x) \propto \prod_{\set{i,j} \in E} \psi_{ij}(x_i, x_j) \prod_{i \in V} \phi_i(x_i). Let {i,j}\set{i, j} be an edge, and let GijG_{ij} be the graph GG with this edge removed. The cavity distribution ฮฝiโ†’j\nu_{i \to j} is the marginal law of xix_i under the Gibbs measure of GijG_{ij}. Write โˆ‚i\partial i for the set of neighbours of ii. The cavity equations are ฮฝiโ†’j(xi)=1ziโ†’jโ€‰ฯ•i(xi)โˆkโˆˆโˆ‚iโˆ–{j}โˆ‘xkโˆˆ๐’ณฯˆik(xi,xk)โ€‰ฮฝkโ†’i(xk),\nu_{i \to j}(x_i) = \frac{1}{z_{i \to j}} \, \phi_i(x_i) \prod_{k \in \partial i \setminus \set{j}} \sum_{x_k \in \mathcal{X}} \psi_{ik}(x_i, x_k) \, \nu_{k \to i}(x_k), where ziโ†’jz_{i \to j} makes ฮฝiโ†’j\nu_{i \to j} a probability measure on ๐’ณ\mathcal{X}. The cavity method is the following procedure for a large graph. It assumes that the cavity distributions satisfy the cavity equations up to a small error. It solves these equations and computes the marginals and the free energy of ฮผ\mu from the solution.

Remarks

If GG is a tree, the cavity equations hold exactly. Indeed, remove the edge {i,j}\set{i, j} and then the vertex ii. The component of ii splits into subtrees hanging from the neighbours kโ‰ jk \ne j, and these subtrees are independent given xix_i. Example: on the path 1โˆ’2โˆ’31 - 2 - 3, the cavity distribution ฮฝ2โ†’3\nu_{2 \to 3} is proportional to ฯ•2(x2)โˆ‘x1ฯˆ12(x2,x1)ฯ•1(x1)\phi_2(x_2) \sum_{x_1} \psi_{12}(x_2, x_1) \phi_1(x_1), since ฮฝ1โ†’2โˆฯ•1\nu_{1 \to 2} \propto \phi_1.

Non-example: on a cycle of length 33, removing one edge leaves a path. The two other neighbours of a vertex are still joined there, so the cavity equations are only an approximation.

The version above is called replica symmetric. On random graphs with many pure states, the one-step replica symmetry breaking cavity method replaces each ฮฝiโ†’j\nu_{i \to j} by a probability law over cavity distributions. On trees, the cavity equations are the equations of belief propagation.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Gibbs measure concept
  2. Graph concept
  3. Probability measure concept
  4. Cavity method definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Cavity_method
About this page
TagX3QRCGR51V
URIm2://X3QRCGR51V
Kinddefinition
WritingW0 stub
MSC82B44, 82B20, 60K35
DefinesCavity method
UsesGraph, Probability measure, Gibbs measure
Changed3 November 2026

Markdown ยท JSON ยท Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.