Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 28 2 a by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 4 Solution by
Codex 0 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.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 26 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Order configurations coordinatewise. The FKG lattice condition on the masses of a finite Boolean lattice isThe FKG inequality states that under this condition, increasing real-valued functions satisfy . In particular increasing events satisfy . For a product measure with coordinate weights , the pair has the same two entries as . Multiplying over coordinates gives equality in the lattice condition, including degenerate Bernoulli parameters without division by zero.
For independent bond percolation on the nearest-neighbor cubic lattice, write . Define the percolation critical probability and the connective constant bywhere counts rooted -step self-avoiding walks. Translation invariance makes the root irrelevant, and part (i) proves existence of the latter limit.
First work on the square lattice, whose dual is another translated square lattice. Put and assume . If the open cluster at the origin is finite, its exterior edge boundary contains a closed dual simple circuit surrounding the origin. To see this planar fact, surround its finitely many vertices by their unit square cells and follow the exterior boundary: its crossing primal edges are closed. Resolving repeated boundary vertices into simple circuits leaves a circuit separating the origin from infinity.
Let count such dual circuits of length . Every one crosses the positive horizontal ray at distance at most , because it surrounds the origin and its horizontal span is at most its length. Choosing a ray-crossing edge, an orientation and all but the last edge encodes it by one of at most rooted length- self-avoiding walks. Thus . Choose with . The root-count limit gives , soThis summable tail alone need not make the probability of every enclosing circuit less than one. Choose a large and let be the absence of enclosing closed dual circuits of length at least , with . Let require every primal edge inside to be open. It has positive probability. Both events are increasing. The finite-measure Harris-FKG inequality extends to by decreasing limits over finitely many circuit exclusions, so .
On the origin is connected to every graph vertex of that box. Any closed dual circuit enclosing the origin must then enclose the whole box, hence have length at least . On no such circuit exists, so the origin cluster is infinite. This proves the connective-constant Peierls bound, . Finally the lattice in dimension contains a coordinate copy of the square lattice, whose edge law is unchanged. Percolation in that subgraph implies percolation in the full graph, and hence
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





