In
probability theory
Probability theory is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expressing it through a set o ...
and
statistical mechanics, the Gaussian free field (GFF) is a
Gaussian random field, a central model of random surfaces (random height functions). gives a mathematical survey of the Gaussian free field.
The discrete version can be defined on any
graph
Graph may refer to:
Mathematics
*Graph (discrete mathematics), a structure made of vertices and edges
**Graph theory, the study of such graphs and their properties
*Graph (topology), a topological space resembling a graph in the sense of discre ...
, usually a
lattice in ''d''-dimensional Euclidean space. The continuum version is defined on R
''d'' or on a bounded subdomain of R
''d''. It can be thought of as a natural generalization of
one-dimensional Brownian motion to ''d'' time (but still one space) dimensions: it is a random (generalized) function from R
''d'' to R. In particular, the one-dimensional continuum GFF is just the standard one-dimensional Brownian motion or
Brownian bridge on an interval.
In the theory of random surfaces, it is also called the harmonic crystal. It is also the starting point for many constructions in
quantum field theory
In theoretical physics, quantum field theory (QFT) is a theoretical framework that combines classical field theory, special relativity, and quantum mechanics. QFT is used in particle physics to construct physical models of subatomic particles a ...
, where it is called the Euclidean
bosonic
In particle physics, a boson ( ) is a subatomic particle whose spin quantum number has an integer value (0,1,2 ...). Bosons form one of the two fundamental classes of subatomic particle, the other being fermions, which have odd half-integer sp ...
massless free field. A key property of the 2-dimensional GFF is
conformal invariance, which relates it in several ways to the
Schramm-Loewner Evolution, see and .
Similarly to Brownian motion, which is the
scaling limit
In mathematical physics and mathematics, the continuum limit or scaling limit of a lattice model refers to its behaviour in the limit as the lattice spacing goes to zero. It is often useful to use lattice models to approximate real-world process ...
of a wide range of discrete
random walk
In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space.
An elementary example of a random walk is the random walk on the integer number line \mathbb ...
models (see
Donsker's theorem
In probability theory, Donsker's theorem (also known as Donsker's invariance principle, or the functional central limit theorem), named after Monroe D. Donsker, is a functional extension of the central limit theorem.
Let X_1, X_2, X_3, \ldots be ...
), the continuum GFF is the scaling limit of not only the discrete GFF on lattices, but of many random height function models, such as the height function of
uniform random planar
domino tiling
In geometry, a domino tiling of a region in the Euclidean plane is a tessellation of the region by dominoes, shapes formed by the union of two unit squares meeting edge-to-edge. Equivalently, it is a perfect matching in the grid graph formed b ...
s, see . The planar GFF is also the limit of the fluctuations of the
characteristic polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The ...
of a
random matrix
In probability theory and mathematical physics, a random matrix is a matrix-valued random variable—that is, a matrix in which some or all elements are random variables. Many important properties of physical systems can be represented mathemat ...
model, the Ginibre ensemble, see .
The structure of the discrete GFF on any graph is closely related to the behaviour of the
simple random walk on the graph. For instance, the discrete GFF plays a key role in the proof by of several conjectures about the cover time of graphs (the expected number of steps it takes for the random walk to visit all the vertices).
Definition of the discrete GFF

Let ''P''(''x'', ''y'') be the transition kernel of the
Markov chain
A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. Informally, this may be thought of as, "What happen ...
given by a
random walk
In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space.
An elementary example of a random walk is the random walk on the integer number line \mathbb ...
on a finite graph ''G''(''V'', ''E''). Let ''U'' be a fixed non-empty subset of the vertices ''V'', and take the set of all real-valued functions
with some prescribed values on ''U''. We then define a
Hamiltonian by
:
Then, the random function with
probability density proportional to
with respect to the
Lebesgue measure
In measure theory, a branch of mathematics, the Lebesgue measure, named after French mathematician Henri Lebesgue, is the standard way of assigning a measure to subsets of ''n''-dimensional Euclidean space. For ''n'' = 1, 2, or 3, it coincides ...
on
is called the discrete GFF with boundary ''U''.
It is not hard to show that the
expected value
In probability theory, the expected value (also called expectation, expectancy, mathematical expectation, mean, average, or first moment) is a generalization of the weighted average. Informally, the expected value is the arithmetic mean of a ...