Random Lattices, Matrix Models, and Random Surfaces
The previous page emphasized a conceptual problem that becomes unavoidable in gravity: if geometry is dynamical, a fixed coordinate lattice is not an innocent regulator. A square lattice presupposes a background coordinate system. A diffeomorphism-invariant theory wants something subtler: a sum over geometries, or at least a regulator whose combinatorics does not hardwire one geometry as the preferred one.
Random lattices are the cleanest discrete version of that idea. Instead of putting fields on one fixed lattice, we sum over many lattices, weighted by area, topology, and matter degrees of freedom. In two dimensions this becomes more than a formal dream. Matrix integrals generate precisely the right class of diagrams: ribbon graphs, whose fattened edges define oriented surfaces. The large- expansion then becomes a topological expansion by genus.
This page develops three connected ideas:
- a random lattice is a discrete sum over geometries;
- matrix models generate random two-dimensional surfaces through ribbon Feynman diagrams;
- the continuum limit is a critical point whose nonanalyticity is controlled by arbitrarily large maps.
The payoff is a new interpretation of Feynman diagrams. In ordinary QFT a diagram is drawn in a pre-existing spacetime. In a matrix model, a diagram can itself be a discretized spacetime.
From a fixed lattice to a sum over lattices
Section titled “From a fixed lattice to a sum over lattices”A fixed lattice is usually introduced as a short-distance cutoff. If the lattice spacing is , momenta above order are absent, and the functional integral becomes finite-dimensional. For an ordinary statistical system this is exactly what we want: microscopic details are part of the definition, and universality tells us when large-distance physics stops caring about them.
For a gravitational theory the logic changes. A lattice spacing defined with respect to a coordinate grid is not itself diffeomorphism-invariant. The physical distance between neighboring sites depends on the metric. A regulator that is supposed to approximate fluctuating geometry should not keep the coordinate grid fixed while only the fields fluctuate. It should allow the lattice itself to fluctuate.
A schematic random-lattice partition function has the form
where runs over triangulations, quadrangulations, or another chosen class of combinatorial surfaces. The automorphism factor prevents overcounting of lattices with discrete symmetries. The factor is the discrete analogue of the cosmological term
The matter partition function is computed on the graph . For example, a scalar field on vertices gives a discrete Gaussian action built from edge differences.
A random-lattice regulator replaces a fixed coordinate grid by a sum over combinatorial geometries. The continuum limit is approached by tuning the lattice fugacity so that large maps control the singular part.
The key point is that is not embedded in a background plane unless we explicitly add embedding fields. Its connectivity is the geometry. A triangle knows which triangles neighbor it. A path length is the number of links along a path, multiplied by the lattice spacing. Curvature is encoded by the deficit angle around vertices. This is the discrete analogue of intrinsic geometry.
For a triangulated closed surface with equilateral triangles, curvature is concentrated at vertices. If triangles meet at a vertex , the deficit angle is
The discrete Gauss–Bonnet theorem reads
where
is the Euler characteristic of a genus- orientable closed surface. Already at this elementary level, the topology of a surface is encoded combinatorially.
Ordinary graphs versus ribbon graphs
Section titled “Ordinary graphs versus ribbon graphs”A scalar zero-dimensional integral, understood as a formal power series in ,
generates ordinary quartic Feynman graphs. Expanding in gives
Wick’s theorem pairs the factors of , and each pairing is a graph with four-valent vertices. This is a useful graph-counting device, but the graphs are not yet two-dimensional surfaces. An ordinary edge is one line; it has no memory of which side is left or right.
For the surface-counting problem, take a Hermitian matrix and the formal integral
The sign of the quartic term makes the expansion in count quartic graphs with positive weights. The potential is unbounded for real , so this equation defines a formal power series; equivalently, one may obtain the series by analytic continuation from a stable potential. Normalize the connected vacuum generating function by
The logarithm selects connected vacuum graphs, while division by removes the empty Gaussian vacuum. With this normalization the Gaussian contraction is
A matrix field changes this. The field carries two indices. Its propagator has two Kronecker deltas,
so one draws it as a double line. The vertex
has a cyclic ordering of its four half-edges. This cyclic ordering is the missing data. It tells us how to thicken the graph into a ribbon graph, and a ribbon graph determines an oriented surface.
A Hermitian matrix propagator carries two index lines. Vacuum diagrams therefore thicken into orientable surfaces. The dual of a quartic ribbon graph is a random quadrangulation.
For the quartic one-matrix model, every interaction vertex is four-valent. The dual surface is therefore a quadrangulation: every vertex of the ribbon graph becomes a square face of the dual lattice. A cubic matrix model instead generates triangulations. The precise polygon type is not universal; different microscopic polygons can belong to the same continuum universality class.
The important object is not the thin graph but the fat graph. Once the graph is thickened, the number of faces is the number of closed index loops. Those faces are not interaction vertices. They are the regions swept out by index lines, and they carry factors of .
The large-N genus expansion
Section titled “The large-N genus expansion”The power of attached to a connected vacuum ribbon graph is purely topological. Suppose the graph has quartic vertices, propagators, and index faces. From the action normalization,
- each vertex contributes ;
- each propagator contributes ;
- each closed index loop contributes .
Thus the total weight is
But
for a connected orientable closed surface of genus . Therefore
This is the same topological organization as closed-string perturbation theory, where the string coupling weights a genus- worldsheet by . In the matrix model, the identification is
A connected ribbon graph carries the factor . Planar graphs dominate at large ; handles are suppressed by powers of .
The connected generating function therefore has the formal expansion
where sums connected ribbon graphs of genus . The leading term is the planar or spherical contribution. The next term is the torus contribution, and so on.
This is the reason matrix models are not just a cute graph-counting trick. They give a controllable topological expansion. The combinatorics of matrix indices knows about surfaces.
Why planar diagrams are random surfaces
Section titled “Why planar diagrams are random surfaces”A planar ribbon graph can be drawn on the sphere without crossing its ribbons. Its dual graph is a discretized sphere made of polygons. If there are interaction vertices in the ribbon graph, the dual surface has polygonal faces. The coefficient of in the planar free energy counts such surfaces with area , weighted by symmetry factors.
Equivalently,
where is the weighted number of spherical quadrangulations with faces. Tuning is therefore tuning a discrete cosmological constant. If is small, large surfaces are suppressed. As approaches its critical value , the large-area tail controls the nonanalytic behavior.
The continuum limit is not obtained by taking a single triangulation and making it smoother. It is a scaling limit of the large- tail near the first singularity . Care is needed when turning this statement into an expectation value: the unmarked sphere series need not have a divergent mean area because its coefficients carry a strong negative power of .
A convenient positive ensemble has two marked faces. Its partition series is
The mean area in this marked ensemble is
For pure gravity it diverges as , so the lattice spacing can be sent to zero while the physical area is kept fixed:
This is the same Wilsonian logic as before, but now applied to geometry. The continuum surface is a scaling limit of large random maps.
The number of maps grows exponentially with area, with a universal power-law correction. Tuning the graph fugacity to its critical value makes large maps control the singular part; in a two-marked ensemble the mean area diverges.
There is a small convention trap here. The unmarked spherical connected generating function has the standard singular form
so its coefficients behave as
If instead we count surfaces with two marked points or faces, applying multiplies each coefficient by , giving
Both forms appear in the literature. The exponent is called the string susceptibility exponent. For pure two-dimensional gravity, the exact value is
so unmarked planar maps grow like
up to a nonuniversal constant. The exponential factor depends on microscopic choices such as triangulations versus quadrangulations. The power is universal within the continuum theory.
Diagonalizing the matrix integral
Section titled “Diagonalizing the matrix integral”The one-matrix model can also be studied without drawing diagrams. Since the action is invariant under
we diagonalize
The measure becomes
where
is the Vandermonde determinant. Therefore
where
for the formal quartic model.
The eigenvalues behave like a one-dimensional gas. For a stable potential, confines them, while the logarithm repels coincident eigenvalues. In the formal quartic counting model, the same equations are interpreted perturbatively or by analytic continuation. The saddle-point equation is
At large we introduce a density
Then the saddle equation becomes the singular integral equation
After diagonalization, the Vandermonde determinant turns matrix integration into a Coulomb gas of eigenvalues. The large- saddle is described by a continuous density supported on one or more cuts.
The resolvent
is the most efficient way to solve the saddle. Across a cut, its discontinuity gives the density:
For the Gaussian potential , the solution is Wigner’s semicircle,
For the quartic model, the endpoint behavior changes as approaches a critical value. At criticality the eigenvalue density develops a higher-order zero at the endpoint of its support. That endpoint singularity is the eigenvalue-language version of large-area random surfaces.
Double scaling and the continuum surface
Section titled “Double scaling and the continuum surface”The planar limit keeps first, so only the sphere survives. The continuum surface limit tunes , where large maps control the singular part and marked-area moments diverge. The most interesting limit combines the two. Near criticality, a genus- contribution behaves schematically as
for the simplest one-matrix universality classes. The exact exponent depends on the matter coupled to gravity, but the important point is structural: higher-genus terms become more singular as .
The double-scaling limit sends
while keeping the appropriate combination
fixed. This retains contributions from all genera:
This is why matrix models historically gave a nonperturbative handle on two-dimensional string theory. They produce a sum over random worldsheets, and the double-scaling limit makes the sum continuum while preserving topology-changing effects.
For the present course, the conceptual message is more important than the exact exponent in the double-scaling variable. The matrix size is not merely a technical parameter. It is the inverse string coupling. The matrix coupling is a lattice fugacity, or equivalently a cosmological constant. The critical point is the continuum limit.
Matter on a random lattice
Section titled “Matter on a random lattice”A random surface can carry matter. On a triangulation , put a target-space coordinate at every vertex . A natural discrete Dirichlet action is
where the sum is over edges and the dimensionless weights encode the local geometry. For an equilateral triangulation one may take all weights equal and absorb their common value into ; on a general piecewise-flat mesh, cotangent weights give the finite-element discretization. There is no extra in two dimensions: the factor from the cell area cancels the in the squared finite difference. Then
This is the discrete version of the formal Polyakov path integral for embedding fields at fixed topology,
The first term measures how the worldsheet is embedded in target space. The second term counts its intrinsic area. The quotient is schematic: gauge fixing the diffeomorphism and Weyl redundancies introduces Faddeev–Popov ghosts, moduli integrals, and, when the total Weyl anomaly does not cancel, a dynamical conformal factor.
Assigning target-space coordinates to the vertices of a triangulation gives a weighted discrete Dirichlet action for an embedded random surface. The sum over triangulations is the discrete analogue of the sum over worldsheet metrics.
This expression is the meeting point of several earlier themes. The worldline representation of a particle sums over one-dimensional paths. The string path integral sums over two-dimensional surfaces. Random lattices give a nonperturbative discretization of that surface sum.
There is also a crucial anomaly constraint. In conformal gauge,
the Weyl factor decouples only when the total central charge vanishes. The reparametrization ghosts contribute , so a theory containing only free embedding scalars requires
for anomaly cancellation. Away from this critical dimension, or with additional worldsheet matter, the conformal anomaly generates Liouville dynamics for . Thus the random-surface measure is not just a combinatorial detail; it knows about the same conformal anomaly discussed earlier.
Integrated vertex operators and observables
Section titled “Integrated vertex operators and observables”If the surface is embedded in a target space, we can define target-space observables by integrating over the worldsheet. A basic example is the target-space density of the surface,
Its Fourier transform is the integrated vertex operator
These operators are natural because they do not ask for the value of at a preferred worldsheet coordinate. They integrate over the surface. In conformal gauge, however, reparametrization invariance alone is not enough: the local matter operator must have conformal weights , possibly after Liouville dressing, so that its integral is Weyl-invariant. For the free-boson normalization used above,
and the exponential has weights
Here is the Euclidean free-boson norm; analytic continuation to Lorentzian target signature gives the corresponding signature-dependent mass-shell relation. Thus the bare integrated exponential is marginal only when ; more general physical vertices include oscillator factors, ghosts in the unintegrated form, or Liouville dressing. This is the worldsheet origin of string mass-shell constraints.
Integrated vertex operators are natural observables on a fluctuating surface because they do not depend on a chosen worldsheet coordinate. Weyl invariance imposes the on-shell condition for physical string amplitudes.
A more geometric target-space observable is the local tangent tensor density
Such operators probe how the random surface is distributed in target space. They are reparametrization-invariant because all worldsheet coordinates are integrated over with the invariant measure. Their precise renormalization is subtle, because composite operators on a fluctuating surface mix under short-distance regularization.
Factorial growth versus planar criticality
Section titled “Factorial growth versus planar criticality”It is tempting to say that matrix integrals “sum all diagrams,” but this phrase hides two different growth problems.
For an ordinary zero-dimensional integral, the number of Wick contractions grows factorially. The perturbation series is typically asymptotic. This is not special to matrices; it is the usual fate of perturbation theory.
Matrix models add a topological organization. At fixed topology, especially in the planar sector, the number of maps with area has the controlled form
The exponential factor sets the radius of convergence. The power-law factor encodes continuum critical behavior. Thus the planar series has a genuine critical point, and the continuum limit is extracted from the singular part near that point.
This distinction matters. The statement “all diagrams grow factorially” is true for unrestricted perturbation theory. The statement “planar maps have a critical continuum limit” is also true, but it refers to the fixed-topology, large- sector. The large- expansion separates these issues.
Summary
Section titled “Summary”Random lattices discretize the idea of summing over geometries. Instead of placing fields on a fixed grid, one sums over graphs or triangulations, weighted by their area and matter partition functions. In two dimensions, matrix integrals generate these sums automatically.
The reason is index structure. A matrix propagator has two lines, and a matrix vertex has a cyclic ordering. Feynman diagrams therefore thicken into ribbon graphs, which define oriented surfaces. The power of attached to a connected diagram is , so the large- expansion is a genus expansion.
The continuum random surface is reached at a critical coupling where arbitrarily large maps control the nonanalytic part of the generating function; in the two-marked ensemble, the mean area diverges. The singularity of the planar connected generating function encodes the string susceptibility exponent. Diagonalizing the matrix model gives an equivalent eigenvalue-gas description, where criticality appears as a special endpoint behavior of the eigenvalue density.
Adding vertex variables produces embedded random surfaces, the discrete form of the Polyakov string path integral. Integrated vertex operators are the natural observables because they respect worldsheet reparametrization invariance. Weyl invariance then supplies the on-shell conditions of string theory.
Common pitfalls
Section titled “Common pitfalls”Connectivity, not appearance. A random lattice is not a randomly distorted drawing of a fixed lattice. Its connectivity is itself summed over.
Ribbon data matter. A matrix Feynman diagram is not just an ordinary graph with labels. The double-line structure gives a cyclic ordering and hence a surface.
Large is not the continuum limit. Large selects topology, usually the sphere. The continuum limit comes from tuning the area fugacity to criticality.
Marking changes area powers. The exponent in depends on whether surfaces are marked. The unmarked sphere generating function has coefficients , while two marked points shift the power to . Consequently, a claim that “the mean area diverges” must specify the ensemble.
Integration does not ensure Weyl invariance. An integrated worldsheet operator is automatically reparametrization-invariant, but not automatically physical. Its local integrand must have weights , possibly after dressing, so that the insertion is compatible with Weyl invariance.
Exercises
Section titled “Exercises”Genus weight of a ribbon graph
Section titled “Genus weight of a ribbon graph”Consider the Hermitian matrix model with Gaussian propagator
and quartic interaction . Show that a connected ribbon vacuum graph with vertices, propagators, and index faces carries the factor
Then interpret this power in terms of the genus of the corresponding surface.
Solution
Each quartic vertex comes from the interaction term and contributes a factor proportional to . Therefore vertices contribute
Each propagator contributes a factor , so propagators contribute
Every closed index loop is freely summed from to , so every face contributes a factor . Hence faces contribute
Multiplying the factors gives
For a connected orientable ribbon graph, the thickened graph is a closed orientable surface with Euler characteristic
Thus the graph carries the topological weight
Planar diagrams have and scale as . A one-handle correction has and scales as .
Eigenvalue saddle equation
Section titled “Eigenvalue saddle equation”Diagonalize a Hermitian matrix , with . Assuming the measure contains the Vandermonde factor , derive the large- saddle equation
Solution
The eigenvalue representation of the matrix integral is
The exponent is
The saddle equation for is
Thus
At large , define
The sum becomes a principal-value integral because the term is omitted:
This gives
Critical coefficients and singular behavior
Section titled “Critical coefficients and singular behavior”Suppose the unmarked planar map coefficients behave as
Show that the singular part of
has the form
up to analytic terms and a nonuniversal constant.
Solution
Near , define
The large- tail controls the nonanalytic part. Its model sum is a polylogarithm:
After subtracting the finitely many terms analytic in , the small- expansion contains
The same result follows by replacing only the large- tail by a Laplace integral and treating its lower endpoint by analytic subtraction. Therefore
Since is proportional to near criticality,
For noninteger this is the nonanalytic critical behavior. At exceptional integer exponents the continuation instead produces logarithms. Analytic terms depend on small and are not fixed by the coefficient asymptotics.
Reparametrization invariance of an integrated vertex
Section titled “Reparametrization invariance of an integrated vertex”Show that the integrated vertex operator
is invariant under worldsheet reparametrizations, assuming is a scalar field on the worldsheet.
Solution
Under a reparametrization , the scalar field satisfies
The area element transforms as a density:
Therefore
So is reparametrization-invariant. This does not yet guarantee Weyl invariance. For a physical string vertex operator, the integrand must also have the correct conformal weight.
Continuum limit of the lattice Dirichlet action
Section titled “Continuum limit of the lattice Dirichlet action”For a triangulation with vertex variables , consider
Explain why this is the natural discrete analogue of
Solution
On a fine triangulation, neighboring vertices are separated by a proper distance of order the lattice spacing. If varies slowly across the lattice, then along an edge
where is a unit tangent direction on the triangulation. Each squared difference is therefore of order . A two-dimensional region of fixed area contains order edges, so these powers cancel. With finite-element weights, the sum converges to the Dirichlet energy:
The precise constant depends on the lattice and on the weights and is absorbed into , which is matched to in the continuum normalization. An additional factor would double-count the derivative scaling in two worldsheet dimensions.
References
Section titled “References”-
Di Francesco, P., Ginsparg, P., and Zinn-Justin, J. “2D Gravity and Random Matrices.” Physics Reports 254 (1995): 1–133. https://doi.org/10.1016/0370-1573(94)00084-G.
-
Eynard, B. Counting Surfaces. Progress in Mathematical Physics 70. Basel: Birkhäuser, 2016.
-
Ginsparg, P., and Moore, G. “Lectures on 2D Gravity and 2D String Theory.” In Recent Directions in Particle Theory: From Superstrings and Black Holes to the Standard Model, TASI 1992, 277–469. Singapore: World Scientific, 1993. arXiv:hep-th/9304011.
-
Polyakov, A. M. Gauge Fields and Strings. Contemporary Concepts in Physics 3. Chur: Harwood Academic Publishers, 1987.
-
Zinn-Justin, J. Quantum Field Theory and Critical Phenomena. 4th ed. Oxford: Clarendon Press, 2002.