Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 27 3 Solution 2026-10-14
The common Brownian motion cancels from the difference . Before either lifetime,Hence and : if reached zero first, the positive smaller solution could not persist beyond that time. WriteUsing the Itô formula for givesThe difference has finite variation, so there is no cross-variation term in the Itô product rule for . Since ,For , the Itô formula therefore makes its drift vanish exactly whenA nonconstant increasing scale function of a one-dimensional diffusion satisfiesThe assumptions and are precisely the integrability conditions at zero and one. Normalize the scale function by its endpoints:Here is the regularized incomplete beta function. The normalized function is continuous and strictly increasing on , with and . We have obtained the local martingale
The terminal identification needs care; mere boundedness does not by itself say what happens when both lifetimes coincide. Stop first on compact subsets of , and then exhaust the interval . The bounded local martingale criterion makes a bounded martingale with a limit , and optional sampling theorem gives . For completeness, applying the Itô formula to each stopped bounds the expected quadratic variation by one. Monotone convergence over the localization sequence impliesSince is continuous on , itself has a limit .
On , while , so and . On , the supplied divergent clock isIf , then eventually is bounded below by a positive constant. This remains true if its limit is one: diverges there, rather than tending to zero. The divergent clock would then force , contradicting the finite quadratic variation. Thus and on the simultaneous-lifetime event. We have provedTaking expectations yields the complete probability formulaThis is the beta integral for strict ordering of coupled Bessel lifetimes; the complementary probability is the probability of simultaneous swallowing, not of the larger initial point dying first.
To connect the calculation to SLE, let its driver be . For a positive boundary point before its boundary swallowing time, put . The Chordal Loewner equation givesThus two positive boundary points give exactly the coupled Bessel processes above, with and . The interval corresponds to . Their boundary swallowing times obeyThe formula quantifies whether the growing hull separates one boundary point from infinity before the other, or swallows them together inside the same boundary interval. It does not identify swallowing with visiting each point. At , the two beta parameters are and this becomes the Cardy boundary crossing formula in the corresponding cross-ratio coordinate, explaining its role in the conformal invariance of planar percolation.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 35 2 a Solution Created 2026-10-03 Updated 2026-10-07
At criticality, percolation clusters occur on every scale. Count their filled outer perimeters, discard microscopic loops through a diameter cutoff, and then pass to a scaling limit. The cutoff gives a locally finite measure on loops of macroscopic size inside a bounded region; summing over scales gives a sigma-finite measure rather than a probability distribution.
The conformal invariance of planar percolation makes these limiting perimeter statistics covariant under conformal maps. Moreover, deciding whether a filled outer perimeter lies in a simply connected subdomain uses only the configuration it encloses: changing the configuration outside that subdomain does not change that perimeter. This is the restriction part of the argument. Conformal covariance together with this domain consistency motivates a nonzero conformal restriction measure on simple loops.
This is an informal construction principle, as requested; it does not replace the tightness, boundary-simplification and uniqueness theorems required to construct the continuum measure rigorously.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 4 Solution Created 2026-10-03 Updated 2026-10-07
Independent bond percolation turns a deterministic graph into a random network: each edge is open with probability , independently, and a percolation cluster is a connected component of its open subgraph. Site percolation instead randomizes vertices. On the cubic lattice the percolation probability is the order parameter and is the critical probability. A monotone coupling, using independent uniform edge labels and opening labels below , makes the growth of connectivity with transparent.
For , : self-avoiding walk counting gives , and the planar bound proved above gives an upper bound below one. Below , clusters are finite and connection probabilities decay exponentially, a percolation sharpness theorem rather than a consequence of the threshold definition alone. Above there is almost surely a unique infinite percolation cluster. At criticality, the presence of an infinite percolation cluster must be addressed for the particular model. In two dimensions there is none. The transition replaces a finite characteristic length by scale-free geometry, followed by a macroscopic connected component.
Percolation critical exponents quantify different aspects of this change. Use power-law notation for leading exponents; it may suppress amplitudes and logarithmic corrections. From the subcritical side, define the percolation susceptibility and an exponential correlation length , using a fixed norm for the one-arm rate. Above criticality the unrestricted expectation is infinite, so a finite-cluster percolation susceptibility must exclude the infinite percolation cluster. The principal observables are:
The last distribution is not the distribution seen from a uniformly chosen site: the latter is weighted by cluster size. In the scaling description this accounts for . Under the usual below-upper-critical-dimension scaling hypotheses, further scaling relations for critical exponents includeThey organize the exponents into a small number of independent quantities; they are not automatic identities following only from their definitions. A percolation cluster fractal dimension describes the mass of a large critical cluster of radius as roughly , with the scaling relation for critical exponents in this regime.
The percolation universality hypothesis is that ordinary short-range independent models in the same spatial dimension share these exponents and their continuum behavior despite differing microscopic lattices or using bonds rather than sites. The threshold itself is not universal. Long-range connections, correlations or changes of geometry can change the universality class, so the hypothesis does not include every random graph called percolation.
Two dimensions have a particularly strong geometric structure. Closed planar dual graph circuits obstruct primal open paths. The Harris-Kesten theorem fixes the square lattice bond percolation threshold at , using planar duality and crossing estimates. Self-duality alone is not a proof; uniform rectangle-crossing control is a crucial extra ingredient. The Russo-Seymour-Welsh theorem keeps critical crossing probabilities of rectangles of fixed aspect ratio bounded away from zero and one at all scales. Closed dual circuits on disjoint annular scales then rule out an infinite critical cluster and reveal why arbitrarily large finite structures persist.
Critical site percolation on the triangular lattice has rigorously established conformal invariance of planar percolation for crossing limits and an SLE description of interfaces. These results are specific to this model. The exact planar valuesare rigorously established there; its one-arm probability has exponent . In the corresponding scaling description these values give , , and . The percolation universality hypothesis predicts the same planar exponents for square lattice bond percolation, but the triangular-lattice theorem by itself does not prove that transfer. This distinction separates exact model-specific mathematics from a broader physical prediction.
Dimension changes the importance of loops and correlations between growing branches. The mean-field percolation exponents come from approximating critical clusters by branching processes. Their values are , , , , and . The predicted upper critical dimension of percolation is six. One way to see its role is the triangle diagram appearing in the percolation triangle condition: if the long-distance Fourier connectivity behaves like , its infrared contribution is proportional to . It is finite above six and logarithmically divergent at six. This motivates mean-field behavior above six and logarithmic corrections at six, without turning that heuristic into a proof for every lattice.
Lace expansion makes the mean-field picture rigorous in suitable high-dimensional regimes. For nearest-neighbor percolation, sufficiently high dimensions are covered; sufficiently spread-out models have mean-field results for every . Between two and six the exponents depend nontrivially on dimension, and exact three-dimensional values are not supplied by the planar theory. Hyperscaling relation illustrates the change: mean-field values give , while , so the naive equality fails above six. In , and no infinite percolation cluster exists for ; this is a degenerate endpoint case rather than the ordinary interior transition.
The threshold locates the transition, critical exponents describe its geometry and singularities, and the percolation universality hypothesis proposes which microscopic distinctions disappear at large scales. Planar dual graph arguments and conformal invariance of planar percolation make exceptional, while six marks the expected boundary of mean-field scaling.
Triangular lattice 2026-10-07
The planar graph with vertices and edges between vertices at Euclidean distance one. Every vertex of a graph has six neighbors. Its site percolation model is a particularly tractable setting for conformal invariance of planar percolation.