Percolation theory

In statistical physics and mathematics, percolation theory describes the behavior of a network when nodes or links are added. This is a geometric type of phase transition, since at a critical fraction of addition the network of small, disconnected clusters merge into significantly larger connected, so-called spanning clusters. The applications of percolation theory to materials science and in many other disciplines are discussed here and in the articles Network theory and Percolation (cognitive psychology).

Introduction

A three-dimensional site percolation graph

Bond percolation in a square lattice from p=0.3 to p=0.52

A representative question (and the source of the name) is as follows. Assume that some liquid is poured on top of some porous material. Will the liquid be able to make its way from hole to hole and reach the bottom? This physical question is modelled mathematically as a three-dimensional network of n × n × n vertices, usually called "sites", in which the edge or "bonds" between each two neighbors may be open (allowing the liquid through) with probability p, or closed with probability 1 – p, and they are assumed to be independent. Therefore, for a given p, what is the probability that an open path (meaning a path, each of whose links is an "open" bond) exists from the top to the bottom? The behavior for large n is of primary interest. This problem, called now bond percolation, was introduced in the mathematics literature by Broadbent & Hammersley (1957), and has been studied intensively by mathematicians and physicists since then.

In a slightly different mathematical model for obtaining a random graph, a site is "occupied" with probability p or "empty" (in which case its edges are removed) with probability 1 – p; the corresponding problem is called site percolation. The question is the same: for a given p, what is the probability that a path exists between top and bottom? Similarly, one can ask, given a connected graph at what fraction 1 – p of failures the graph will become disconnected (no large component).

A 3D tube network percolation determination

The same questions can be asked for any lattice dimension. As is quite typical, it is actually easier to examine infinite networks than just large ones. In this case the corresponding question is: does an infinite open cluster exist? That is, is there a path of connected points of infinite length "through" the network? By Kolmogorov's zero–one law, for any given p, the probability that an infinite cluster exists is either zero or one. Since this probability is an increasing function of p (proof via coupling argument), there must be a critical p (denoted by p_c) below which the probability is always 0 and above which the probability is always 1. In practice, this criticality is very easy to observe. Even for n as small as 100, the probability of an open path from the top to the bottom increases sharply from very close to zero to very close to one in a short span of values of p.

Detail of a bond percolation on the square lattice in two dimensions with percolation probability p = 0.51

History

The Flory–Stockmayer theory was the first theory investigating percolation processes.

The history of the percolation model as we know it has its root in the coal industry. Since the industrial revolution, the economical importance of this source of energy fostered many scientific studies to understand its composition and optimize its use. During the 1930s and 1940s, the qualitative analysis by organic chemistry left more and more room to more quantitative studies.

In this context, the British Coal Utilisation Research Association (BCURA) was created in 1938. It is a research association funded by the coal mines owners. In 1942, Rosalind Franklin, who then recently graduated in chemistry from the university of Cambridge, joined the BCURA. She started research on the density and porosity of coal. During the Second World War, coal was an important strategic resource. It was used as a source of energy, but also was the main constituent of gas masks.

Coal is a porous medium. To measure its 'real' density, one was to sink it in a liquid or a gas whose molecules are small enough to fill its microscopic pores. While trying to measure the density of coal using several gases (helium, methanol, hexane, benzene), and as she found different values depending on the gas used, Rosalind Franklin showed that the pores of coal are made of microstructures of various lengths that act as a microscopic sieve to discriminate the gases. She also discovered that the size of these structures depends on the temperature of carbonation during the coal production. With this research, she obtained a PhD degree and left the BCURA in 1946.

In the mid fifties, Simon Broadbent worked in the BCURA as a statistician. Among other interests, he studied the use of coal in gas masks. One question is to understand how a fluid can diffuse in the coal pores, modeled as a random maze of open or closed tunnels. In 1954, during a symposium on Monte Carlo methods, he asks questions to John Hammersley on the use of numerical methods to analyze this model.

Broadbent and Hammersley introduced in their article of 1957 a mathematical model to model this phenomenon, that is percolation.

Computation of the critical parameter

For most infinite lattice graphs, p_c cannot be calculated exactly, though in some cases p_c there is an exact value. For example:

• for the square lattice ℤ² in two dimensions, p_c = ⁠1/2⁠ for bond percolation, a fact which was an open question for more than 20 years and was finally resolved by Harry Kesten in the early 1980s, see Kesten (1982). For site percolation on the square lattice, the value of p_c is not known from analytic derivation but only via simulations of large lattices which provide the estimate p_c = 0.59274621 ± 0.00000013.  
• A limit case for lattices in high dimensions is given by the Bethe lattice, whose threshold is at p_c = ⁠1/z − 1⁠ for a coordination number z. In other words: for the regular tree of degree $z$, $p_{c}$ is equal to $1/(z-1)$.

Percolation front

• For a random tree-like network without degree-degree correlation, it can be shown that such network can have a giant component, and the percolation threshold (transmission probability) is given by $p_{c}={\frac {1}{g_{1}'(1)}}$, where $g_{1}(z)$ is the generating function corresponding to the excess degree distribution. So, for random Erdős–Rényi networks of average degree $\langle k\rangle$, p_c = ⁠1/⟨k⟩⁠.
• In networks with low clustering, $0<C\ll 1$, the critical point gets scaled by $(1-C)^{-1}$ such that:

$p_{c}={\frac {1}{1-C}}{\frac {1}{g_{1}'(1)}}.$

This indicates that for a given degree distribution, the clustering leads to a larger percolation threshold, mainly because for a fixed number of links, the clustering structure reinforces the core of the network with the price of diluting the global connections. For networks with high clustering, strong clustering could induce the core–periphery structure, in which the core and periphery might percolate at different critical points, and the above approximate treatment is not applicable.

Universality

The universality principle states that the numerical value of p_c is determined by the local structure of the graph, whereas the behavior near the critical threshold, p_c, is characterized by universal critical exponents. For example the distribution of the size of clusters at criticality decays as a power law with the same exponent for all 2d lattices. This universality means that for a given dimension, the various critical exponents, the fractal dimension of the clusters at p_c is independent of the lattice type and percolation type (e.g., bond or site). However, recently percolation has been performed on a weighted planar stochastic lattice (WPSL) and found that although the dimension of the WPSL coincides with the dimension of the space where it is embedded, its universality class is different from that of all the known planar lattices.

Phases

Subcritical and supercritical

The main fact in the subcritical phase is "exponential decay". That is, when p < p_c, the probability that a specific point (for example, the origin) is contained in an open cluster (meaning a maximal connected set of "open" edges of the graph) of size r decays to zero exponentially in r. This was proved for percolation in three and more dimensions by Menshikov (1986) and independently by Aizenman & Barsky (1987). In two dimensions, it formed part of Kesten's proof that p_c = ⁠1/2⁠.

The dual graph of the square lattice ℤ² is also the square lattice. It follows that, in two dimensions, the supercritical phase is dual to a subcritical percolation process. This provides essentially full information about the supercritical model with d = 2. The main result for the supercritical phase in three and more dimensions is that, for sufficiently large N, there is almost certainly an infinite open cluster in the two-dimensional slab ℤ² × [0, N]^{d − 2}. This was proved by Grimmett & Marstrand (1990).

In two dimensions with p < ⁠1/2⁠, there is with probability one a unique infinite closed cluster (a closed cluster is a maximal connected set of "closed" edges of the graph). Thus the subcritical phase may be described as finite open islands in an infinite closed ocean. When p > ⁠1/2⁠ just the opposite occurs, with finite closed islands in an infinite open ocean. The picture is more complicated when d ≥ 3 since p_c < ⁠1/2⁠, and there is coexistence of infinite open and closed clusters for p between p_c and 1 − p_c.

Criticality

Zoom in a critical percolation cluster (Click to animate)

Percolation has a singularity at the critical point p = p_c and many properties behave as of a power-law with $p-p_{c}$, near $p_{c}$. Scaling theory predicts the existence of critical exponents, depending on the number d of dimensions, that determine the class of the singularity. When d = 2 these predictions are backed up by arguments from conformal field theory and Schramm–Loewner evolution, and include predicted numerical values for the exponents. Most of these predictions are conjectural except when the number d of dimensions satisfies either d = 2 or d ≥ 6. They include:

• There are no infinite clusters (open or closed)
• The probability that there is an open path from some fixed point (say the origin) to a distance of r decreases polynomially, i.e. is on the order of r^α for some α
  • α does not depend on the particular lattice chosen, or on other local parameters. It depends only on the dimension d (this is an instance of the universality principle).
  • α_d decreases from d = 2 until d = 6 and then stays fixed.
  • α₂ = −⁠5/48⁠
  • α₆ = −1.
• The shape of a large cluster in two dimensions is conformally invariant.

See Grimmett (1999). In 11 or more dimensions, these facts are largely proved using a technique known as the lace expansion. It is believed that a version of the lace expansion should be valid for 7 or more dimensions, perhaps with implications also for the threshold case of 6 dimensions. The connection of percolation to the lace expansion is found in Hara & Slade (1990).

In two dimensions, the first fact ("no percolation in the critical phase") is proved for many lattices, using duality. Substantial progress has been made on two-dimensional percolation through the conjecture of Oded Schramm that the scaling limit of a large cluster may be described in terms of a Schramm–Loewner evolution. This conjecture was proved by Smirnov (2001) in the special case of site percolation on the triangular lattice.

Different models

• Directed percolation that models the effect of gravitational forces acting on the liquid was also introduced in Broadbent & Hammersley (1957), and has connections with the contact process.
• The first model studied was Bernoulli percolation. In this model all bonds are independent. This model is called bond percolation by physicists.
• A generalization was next introduced as the Fortuin–Kasteleyn random cluster model, which has many connections with the Ising model and other Potts models.
• Bernoulli (bond) percolation on complete graphs is an example of a random graph. The critical probability is p = ⁠1/N⁠, where N is the number of vertices (sites) of the graph.
• Bootstrap percolation removes active cells from clusters when they have too few active neighbors, and looks at the connectivity of the remaining cells.
• First passage percolation.
• Invasion percolation.

Applications

In biology, biochemistry, and physical virology

Percolation theory has been used to successfully predict the fragmentation of biological virus shells (capsids), with the fragmentation threshold of Hepatitis B virus capsid predicted and detected experimentally. When a critical number of subunits has been randomly removed from the nanoscopic shell, it fragments and this fragmentation may be detected using Charge Detection Mass Spectroscopy (CDMS) among other single-particle techniques. This is a molecular analog to the common board game Jenga, and has relevance to the broader study of virus disassembly. Interestingly, more stable viral particles (tilings with greater fragmentation thresholds) are found in greater abundance in nature.

In ecology

Percolation theory has been applied to studies of how environment fragmentation impacts animal habitats and models of how the plague bacterium Yersinia pestis spreads.

See also

• Continuum percolation theory
• Critical exponent – Parameter describing physics near critical points
• Directed percolation – Physical models of filtering under forces such as gravity
• Erdős–Rényi model – Two closely related models for generating random graphs
• Fractal – Infinitely detailed mathematical structure
• Giant component – Large connected component of a random graph
• Graph theory – Area of discrete mathematics
• Interdependent networks – Subfield of network science
• Invasion percolation
• Kahn–Kalai conjecture – Mathematical proposition
• Network theory – Study of graphs as a representation of relations between discrete objects
• Network science – Academic field
• Percolation threshold – Threshold of percolation theory models
• Percolation critical exponents – Mathematical parameter in percolation theory
• Scale-free network – Network whose degree distribution follows a power law
• Shortest path problem – Computational problem of graph theory
• Bunkbed conjecture – Conjecture in probabilistic combinatorics

References

• Aizenman, Michael; Barsky, David (1987), "Sharpness of the phase transition in percolation models", Communications in Mathematical Physics, 108 (3): 489–526, Bibcode:1987CMaPh.108..489A, doi:10.1007/BF01212322, S2CID 35592821
• Menshikov, Mikhail (1986), "Coincidence of critical points in percolation problems", Soviet Mathematics - Doklady, 33: 856–859

Further reading

• Austin, David (July 2008). "Percolation: Slipping through the Cracks". American Mathematical Society. Archived from the original on 2009-11-13. Retrieved 2021-04-28.
• Bollobás, Béla; Riordan, Oliver (2006). Percolation. Cambridge University Press. ISBN 978-0521872324. Archived from the original on 2015-09-23. Retrieved 2008-06-26.
• Kesten, Harry (May 2006). "What Is ... Percolation?" (PDF). Notices of the American Mathematical Society. 53 (5): 572–573. ISSN 1088-9477. Archived (PDF) from the original on 2021-05-02. Retrieved 2021-04-28.

External links

• PercoVIS: a Mac OS X program to visualize percolation on networks in real time
• Interactive Percolation
• Nanohub online course on Percolation Theory