Last updated
Fig. 1: In coffee percolation, soluble compounds leave the coffee grounds and join the water to form coffee. Insoluble compounds (and granulates) remain within the coffee filter. Manual coffee preperation.jpg
Fig. 1: In coffee percolation, soluble compounds leave the coffee grounds and join the water to form coffee. Insoluble compounds (and granulates) remain within the coffee filter.
Fig. 2: Percolation in a square lattice (Click to animate) Percolation.gif
Fig. 2: Percolation in a square lattice (Click to animate)

In physics, chemistry and materials science, percolation (from Latin percolare, "to filter" or "trickle through") refers to the movement and filtering of fluids through porous materials. It is described by Darcy's law. Broader applications have since been developed that cover connectivity of many systems modeled as lattices or graphs, analogous to connectivity of lattice components in the filtration problem that modulates capacity for percolation.



During the last decades, percolation theory, the mathematical study of percolation, has brought new understanding and techniques to a broad range of topics in physics, materials science, complex networks, epidemiology, and other fields. For example, in geology, percolation refers to filtration of water through soil and permeable rocks. The water flows to recharge the groundwater in the water table and aquifers. In places where infiltration basins or septic drain fields are planned to dispose of substantial amounts of water, a percolation test is needed beforehand to determine whether the intended structure is likely to succeed or fail. In two dimensional square lattice percolation is defined as follows. 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, see Fig. 2.

Percolation typically exhibits universality. Statistical physics concepts such as scaling theory, renormalization, phase transition, critical phenomena and fractals are used to characterize percolation properties. Combinatorics is commonly employed to study percolation thresholds.

Due to the complexity involved in obtaining exact results from analytical models of percolation, computer simulations are typically used. The current fastest algorithm for percolation was published in 2000 by Mark Newman and Robert Ziff. [1]


See also

Related Research Articles

Complex system System composed of many interacting components

A complex system is a system composed of many components which may interact with each other. Examples of complex systems are Earth's global climate, organisms, the human brain, infrastructure such as power grid, transportation or communication systems, social and economic organizations, an ecosystem, a living cell, and ultimately the entire universe.

Phase transition Physical process of transition between basic states of matter

In chemistry, thermodynamics, and many other related fields, phase transitions are the physical processes of transition between a state of a medium, identified by some parameters, and another one, with different values of the parameters. Commonly the term is used to refer to changes among the basic states of matter: solid, liquid, and gas, as well as plasma in rare cases.

Percolation theory Mathematical theory on behavior of connected clusters in a random graph

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 cluster. The applications of percolation theory to materials science and in many other disciplines are discussed here and in the articles network theory and percolation.

Scale-free network Network whose degree distribution follows a power law

A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network having k connections to other nodes goes for large values of k as

Cascading failure Systemic risk of failure

A cascading failure is a process in a system of interconnected parts in which the failure of one or few parts can trigger the failure of other parts and so on. Such a failure may happen in many types of systems, including power transmission, computer networking, finance, transportation systems, organisms, the human body, and ecosystems.

Self-organized criticality Concept in physics

Self-organized criticality (SOC) is a property of dynamical systems that have a critical point as an attractor. Their macroscopic behavior thus displays the spatial or temporal scale-invariance characteristic of the critical point of a phase transition, but without the need to tune control parameters to a precise value, because the system, effectively, tunes itself as it evolves towards criticality.

Network theory Study of graphs as a representation of relations between discrete objects

Network theory is the study of graphs as a representation of either symmetric relations or asymmetric relations between discrete objects. In computer science and network science, network theory is a part of graph theory: a network can be defined as a graph in which nodes and/or edges have attributes.

Small-world network graph where most nodes are reachable in a small number of steps

A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes N in the network, that is:

Transport network analysis

A transport network, or transportation network is a network or graph in geographic space, describing an infrastructure that permits and constrains movement or flow. Examples include but are not limited to road networks, railways, air routes, pipelines, aqueducts, and power lines. The digital representation of these networks, and the methods for their analysis, is a core part of spatial analysis, geographic information systems, public utilities, and transport engineering. Network analysis is an application of the theories and algorithms of Graph theory and is a form of proximity analysis.

Complex network Network with non-trivial topological features

In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.

Spatial network

A spatial network is a graph in which the vertices or edges are spatial elements associated with geometric objects, i.e., the nodes are located in a space equipped with a certain metric. The simplest mathematical realization of spatial network is a lattice or a random geometric graph, where nodes are distributed uniformly at random over a two-dimensional plane; a pair of nodes are connected if the Euclidean distance is smaller than a given neighborhood radius. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks and biological neural networks are all examples where the underlying space is relevant and where the graph's topology alone does not contain all the information. Characterizing and understanding the structure, resilience and the evolution of spatial networks is crucial for many different fields ranging from urbanism to epidemiology.

Critical exponents describe the behavior of physical quantities near continuous phase transitions. It is believed, though not proven, that they are universal, i.e. they do not depend on the details of the physical system, but only on some of its general features. For instance, for ferromagnetic systems, the critical exponents depend only on:

In network theory, a giant component is a connected component of a given random graph that contains a finite fraction of the entire graph's vertices.

Anomalous diffusion Diffusion process with a non-linear relationship to time

Anomalous diffusion is a diffusion process with a non-linear relationship between the mean squared displacement (MSD), , and time. This behavior is in stark contrast to Brownian motion, the typical diffusion process described by Einstein and Smoluchowski, where the MSD is a linear in time. Examples of anomalous diffusion in nature have been observed in biology in the cell nucleus, plasma membrane and cytoplasm.

The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability p, or more generally a critical surface for a group of parameters p1, p2, ..., such that infinite connectivity (percolation) first occurs.

In the context of the physical and mathematical theory of percolation, a percolation transition is characterized by a set of universal critical exponents, which describe the fractal properties of the percolating medium at large scales and sufficiently close to the transition. The exponents are universal in the sense that they only depend on the type of percolation model and on the space dimension. They are expected to not depend on microscopic details such as the lattice structure, or whether site or bond percolation is considered. This article deals with the critical exponents of random percolation.

Water retention on random surfaces Study of water distribution

Water retention on random surfaces is the simulation of catching of water in ponds on a surface of cells of various heights on a regular array such as a square lattice, where water is rained down on every cell in the system. The boundaries of the system are open and allow water to flow out. Water will be trapped in ponds, and eventually all ponds will fill to their maximum height, with any additional water flowing over spillways and out the boundaries of the system. The problem is to find the amount of water trapped or retained for a given surface. This has been studied extensively for random surfaces.

Interdependent networks Subfield of network science

The study of interdependent networks is a subfield of network science dealing with phenomena caused by the interactions between complex networks. Though there may be a wide variety of interactions between networks, dependency focuses on the scenario in which the nodes in one network require support from nodes in another network. For an example of infrastructure dependency see Fig. 1.

The field of complex networks has emerged as an important area of science to generate novel insights into nature of complex systems The application of network theory to climate science is a young and emerging field. To identify and analyze patterns in global climate, scientists model climate data as complex networks.

Robustness, the ability to withstand failures and perturbations, is a critical attribute of many complex systems including complex networks.


  1. Newman, Mark; Ziff, Robert (2000). "Efficient Monte Carlo Algorithm and High-Precision Results for Percolation". Physical Review Letters . 85 (19): 4104–4107. arXiv: cond-mat/0005264 . Bibcode:2000PhRvL..85.4104N. CiteSeerX . doi:10.1103/PhysRevLett.85.4104. PMID   11056635. S2CID   747665.
  2. Brunk, Nicholas E.; Twarock, Reidun (2021-07-23). "Percolation Theory Reveals Biophysical Properties of Virus-like Particles". ACS Nano. American Chemical Society (ACS). 15 (8): 12988–12995. doi: 10.1021/acsnano.1c01882 . ISSN   1936-0851. PMC   8397427 . PMID   34296852.
  3. Brunk, Nicholas E.; Lee, Lye Siang; Glazier, James A.; Butske, William; Zlotnick, Adam (2018). "Molecular jenga: The percolation phase transition (collapse) in virus capsids". Physical Biology. 15 (5): 056005. Bibcode:2018PhBio..15e6005B. doi:10.1088/1478-3975/aac194. PMC   6004236 . PMID   29714713.
  4. Lee, Lye Siang; Brunk, Nicholas; Haywood, Daniel G.; Keifer, David; Pierson, Elizabeth; Kondylis, Panagiotis; Wang, Joseph Che-Yen; Jacobson, Stephen C.; Jarrold, Martin F.; Zlotnick, Adam (2017). "A molecular breadboard: Removal and replacement of subunits in a hepatitis B virus capsid". Protein Science. 26 (11): 2170–2180. doi:10.1002/pro.3265. PMC   5654856 . PMID   28795465.
  5. R. Cohen and S. Havlin (2010). "Complex Networks: Structure, Robustness and Function". Cambridge University Press.
  6. Parshani, Roni; Carmi, Shai; Havlin, Shlomo (2010). "Epidemic Threshold for the Susceptible-Infectious-Susceptible Model on Random Networks". Physical Review Letters. 104 (25): 258701. arXiv: 0909.3811 . Bibcode:2010PhRvL.104y8701P. doi:10.1103/PhysRevLett.104.258701. ISSN   0031-9007. PMID   20867419.
  7. Grassberger, Peter (1983). "On the Critical Behavior of the General Epidemic Process and Dynamical Percolation". Mathematical Biosciences. 63 (2): 157–172. doi:10.1016/0025-5564(82)90036-0.
  8. Newman, M. E. J. (2002). "Spread of epidemic disease on networks". Physical Review E. 66 (1 Pt 2): 016128. arXiv: cond-mat/0205009 . Bibcode:2002PhRvE..66a6128N. doi:10.1103/PhysRevE.66.016128. PMID   12241447. S2CID   15291065.
  9. D. Li, B. Fu, Y. Wang, G. Lu, Y. Berezin, H.E. Stanley, S. Havlin (2015). "Percolation transition in dynamical traffic network with evolving critical bottlenecks". PNAS. 112 (3): 669–72. Bibcode:2015PNAS..112..669L. doi: 10.1073/pnas.1419185112 . PMC   4311803 . PMID   25552558.CS1 maint: uses authors parameter (link)
  10. Guanwen Zeng, Daqing Li, Shengmin Guo, Liang Gao, Ziyou Gao, HEugene Stanley, Shlomo Havlin (2019). "Switch between critical percolation modes in city traffic dynamics". Proceedings of the National Academy of Sciences. 116 (1): 23–28. Bibcode:2019PNAS..116...23Z. doi: 10.1073/pnas.1801545116 . PMC   6320510 . PMID   30591562.CS1 maint: uses authors parameter (link)
  11. X. Yuan, Y. Hu, H.E. Stanley, S. Havlin (2017). "Eradicating catastrophic collapse in interdependent networks via reinforced nodes". PNAS. 114 (13): 3311–3315. arXiv: 1605.04217 . Bibcode:2017PNAS..114.3311Y. doi: 10.1073/pnas.1621369114 . PMC   5380073 . PMID   28289204.CS1 maint: uses authors parameter (link)

Further reading