Fact-checked by Grok 2 weeks ago

Percolation

Percolation theory is a branch of statistical physics and mathematics that studies the emergence of large-scale connectivity in disordered systems, modeling how clusters form when sites or bonds in a lattice are randomly occupied with probability p, leading to a phase transition at a critical threshold p_c where an infinite spanning cluster appears.^[1] Introduced by Simon R. Broadbent and John M. Hammersley in 1957, it originated as a model for fluid flow through porous media with random blockages, using abstract "crystals" (homogeneous structures) and "random mazes" where bonds are independently dammed with probability q = 1 - p.^[2] The theory addresses key questions such as the existence of infinite clusters and the probability \theta(p) that the origin belongs to an infinite cluster, with \theta(p) = 0 for p < p_c and \theta(p) > 0 for p > p_c in dimensions d \geq 2.^[3] Central models include site percolation, where lattice sites are occupied with probability p and clusters form via nearest-neighbor connections, and bond percolation, where edges between sites are present with probability p; both exhibit critical behavior, with exact p_c = 1/2 for bond percolation on the two-dimensional square lattice.^[1] At criticality, clusters display fractal geometry, with dimension D = 91/48 in two dimensions, and universal critical exponents describe phenomena like the correlation length \xi \propto |p - p_c|^{-\nu} and order parameter P(p) \propto (p - p_c)^\beta for p > p_c.^[1] For p > p_c, there is almost surely a unique infinite cluster, while below p_c, all clusters are finite; these properties hold in d-dimensional lattices for d > 1, with p_c \in (0,1).^[3] Percolation theory unifies insights across dimensions through scaling relations and renormalization group methods, revealing universality classes shared with other critical phenomena, and has been analytically solved in one dimension and mean-field approximations like the Bethe lattice.^[1] Applications span diverse fields, including modeling fluid infiltration in geology and oil recovery, disease spread in epidemiology, conductivity in composite materials, and network resilience in computer science.^[1] Early reviews through 1970 compiled exact and numerical results, emphasizing dimensional invariants for predicting behavior in unstudied systems, while later developments incorporated quantum effects and continuum models.^[4]

General Overview

Definition and Basic Principles

Percolation refers to the movement and filtering of fluids through porous materials, a process derived from the Latin percolare, meaning "to filter" or "trickle through," analogous to sieving where a liquid passes through interconnected voids under the influence of gravity or pressure. In natural systems, such as water infiltrating soil layers, this flow recharges groundwater and depends on the size, distribution, and connectivity of soil pores, which determine the medium's permeability.^[5] Percolation theory formalizes this phenomenon in both continuous and discrete media to study connectivity and flow in random environments. In continuous media, like porous rocks or granular materials, the medium is modeled as a spatial continuum with randomly placed obstacles or voids that allow or block passage. In contrast, discrete media represent the system as lattices or graphs, where individual sites (locations) or bonds (connections) are independently open (permeable) or closed (impermeable) with a given probability p.^[6]^[7] A fundamental principle is that effective percolation—manifesting as a spanning path across a finite system or an infinite connected cluster in the thermodynamic limit—emerges only above a critical probability p_c or density threshold, below which isolated clusters dominate and flow is restricted. This transition bridges physical processes, such as fluid invasion in soils, with abstract applications like information propagation in networks.^[2]^[6]

Historical Context

The concept of percolation traces its roots to 19th-century studies in hydrology, where researchers examined the flow of groundwater through porous aquifers, laying foundational ideas for understanding fluid movement in heterogeneous media. A key precursor was Henry Darcy's experimental work in 1856, which established a linear relationship between hydraulic gradient and flow rate through saturated sands, providing an empirical basis for later models of transport in random porous structures. The term "percolation theory" emerged in the 1950s to describe probabilistic processes in industrial applications such as filtration and polymerization, where random blockages or connections affect material properties. An early analog appeared in Paul Flory's 1941 analysis of gelation in polymer networks, modeling the formation of infinite molecular clusters during cross-linking reactions as a branching process on a tree-like structure. This work anticipated percolation by treating gelation as a critical point where a giant connected component forms. Formal mathematical development began with Simon Broadbent and John Hammersley's 1957 introduction of the percolation model, framing it as a stochastic process for fluid or gas flow through random media, such as a porous stone.^[8] Their model connected to related fields, including the Erdős–Rényi random graph theory from 1959–1960, which described the emergence of a giant connected component in graphs with randomly placed edges, serving as a mean-field approximation for percolation on infinite lattices. In the 1970s, percolation theory gained prominence in statistical physics through investigations of critical phenomena, with Dietrich Stauffer and collaborators applying scaling concepts to cluster formation and phase transitions near the percolation threshold.^[9] This period solidified percolation as a paradigm for universality in disordered systems. By the 1980s, Benoit Mandelbrot interpreted percolation clusters through fractal geometry, highlighting their self-similar structures and scaling properties in his seminal work on natural fractals.^[10] These developments marked percolation's transition from applied modeling to a cornerstone of modern mathematical physics.

Core Concepts in Percolation Theory

Percolation Models

Percolation models serve as foundational mathematical frameworks for analyzing connectivity and phase transitions in disordered systems, capturing how local random occupations lead to global structural properties. The canonical setup involves an infinite lattice, such as the square or triangular lattice, where each site or bond is independently occupied—termed "open"—with probability p (where $0 \leq p \leq 1), and unoccupied or "closed" with probability $1 - p.^[2] This Bernoulli occupation process underpins the randomness, allowing statistical mechanics techniques to probe emergent phenomena.^[11] In these models, open clusters arise from the connection of adjacent open elements, typically via nearest-neighbor rules defining adjacency on the lattice.^[11] The percolation event is defined as the existence of an infinite open cluster, marking the onset of macroscopic connectivity across the system.^[2] To facilitate rigorous analysis, the models incorporate assumptions of translation invariance, ensuring uniform statistical properties across the lattice, and ergodicity, which equates ensemble averages with spatial averages in the infinite-volume limit.^[11] Percolation frameworks extend beyond discrete lattices to encompass various types, distinguishing between discrete and continuum variants as well as undirected and directed orientations. Discrete models operate on fixed lattices or more general graphs, emphasizing site or bond occupations in a structured geometry.^[11] In contrast, continuum percolation replaces lattice points with randomly placed and overlapping geometric shapes, such as disks in two dimensions or spheres in three, where connectivity forms through intersections rather than discrete adjacencies. Undirected models permit symmetric connections, while directed variants impose an orientation, restricting paths to follow a preferred direction, often modeling anisotropic transport.^[11] The percolation threshold p_c, the critical occupation probability where an infinite cluster first appears, delineates subcritical (no infinite cluster) from supercritical (infinite cluster present) regimes in these setups.^[11]

Site and Bond Percolation

Site percolation is a fundamental model in discrete percolation theory, where each vertex, or site, of a regular lattice is independently occupied with probability p, and clusters are formed by connecting occupied sites that are adjacent according to a specified neighborhood, such as 4-neighbor (von Neumann) or 8-neighbor (Moore) connectivity in two dimensions.^[8] This model captures scenarios where the permeability or activity is associated directly with the positions (sites) rather than the connections between them.^[12] In contrast, bond percolation focuses on the edges, or bonds, of the lattice: each possible bond between adjacent sites is independently present with probability p, and clusters are defined as sets of sites connected by paths of present bonds.^[8] Here, the connectivity depends on the explicit presence or absence of links, making it suitable for representing interactions or transmissions along predefined pathways. A key distinction between the two models lies in how blockages or absences propagate: in site percolation, an unoccupied site blocks all potential connections incident to it, effectively removing multiple pathways at once; in bond percolation, absences are edge-specific, allowing sites to remain connected through alternative routes even if some bonds fail. Site percolation is commonly applied to model impurities or defects in crystalline materials, where occupied sites represent regions of conductivity or solubility.^[12] Bond percolation, meanwhile, is frequently used to study resistor networks, where present bonds correspond to conducting links and absences to breaks or insulators.^[12] Bond percolation often exhibits a lower percolation threshold than site percolation due to the relative number of independent random variables (bonds versus sites) in typical lattices, which can lead to connectivity emerging at lower probabilities in bond models. For example, on the square lattice (\mathbb{Z}^2), the site percolation threshold is approximately 0.5927, while the bond percolation threshold is exactly 0.5.^[13] In two dimensions, site percolation on a given lattice is closely correlated with bond percolation on its dual lattice, providing a geometric duality that links the models.^[8]

Mathematical Foundations

Percolation Threshold

In percolation theory, the percolation threshold p_c is defined as the infimum of the occupation probabilities p for which the probability \theta(p) of an infinite open cluster is positive.^[14] For p < p_c, known as the subcritical regime, all connected clusters of open sites or bonds are finite almost surely, while for p > p_c, the supercritical regime, there exists almost surely a unique infinite open cluster.^[15] This threshold marks the onset of long-range connectivity in the lattice or graph.^[16] Exact solutions for p_c are available in certain solvable cases. In one dimension, for a linear chain, percolation requires all sites or bonds to be open, yielding p_c = 1 exactly.^[17] On the Bethe lattice, a tree-like structure with coordination number z (the average number of nearest neighbors), the bond percolation threshold is given precisely by

p_c = \frac{1}{z-1},

derived from the condition for branching processes leading to infinite progeny.^[18] In the mean-field approximation, valid for high dimensions, the threshold approximates the same form p_c \approx 1/(z-1), where z = 2d for the d-dimensional hypercubic lattice.^[19] For regular lattices, exact values are rare, but notable results exist. In two dimensions, the bond percolation threshold on the square lattice is exactly p_c = 1/2, proven via duality arguments showing self-matching of the lattice.^[20] The site percolation threshold on the same lattice is approximately p_c \approx 0.59274605079210(2), obtained from high-precision numerical methods.^[13] In three dimensions, thresholds are higher due to reduced connectivity; for bond percolation on the simple cubic lattice, p_c \approx 0.2488118(4).^[21] Overall, p_c decreases with increasing dimension d, approaching the mean-field limit for d \geq 6, where critical behavior becomes independent of short-range lattice structure.^[22] Estimation of p_c on general lattices relies on analytical and numerical techniques. Series expansions enumerate small clusters or connectivity probabilities up to high orders, allowing extrapolation to the critical point via Padé approximants or differential methods.^[23] Monte Carlo simulations, such as the efficient Newman-Ziff algorithm, add sites or bonds incrementally while tracking cluster statistics like the spanning probability or mean cluster size, enabling precise threshold determination from finite-size scaling across large lattices.^[24] These methods have refined estimates for many lattices, confirming the dimension dependence and mean-field crossover.

Cluster Statistics and Connectivity

In percolation theory, the distribution of cluster sizes provides a quantitative measure of how occupied sites or bonds aggregate into connected components. The number of clusters of size s, denoted n_s(p), where p is the occupation probability, follows a scaling form near the percolation threshold p_c: n_s(p) \sim s^{-\tau} \exp(-s / \xi^d), with \tau a critical exponent and \xi the correlation length that diverges as p approaches p_c. This form captures the power-law decay for small clusters and an exponential cutoff for large ones, reflecting the finite range of connectivity imposed by \xi. Below p_c, all clusters are finite, and the distribution decays rapidly for large s, leading to a largest cluster size that scales logarithmically with the system size N, approximately \sim \log N. The connectivity between sites is described by the pair connectedness function G(r), which gives the probability that two sites separated by distance r belong to the same cluster. For large r, G(r) \sim \exp(-r / \xi) below criticality, indicating that connections decay exponentially beyond the correlation length. Above p_c, an infinite cluster emerges with positive density P_\infty(p) > 0, marking the onset of long-range connectivity, while finite clusters still follow a modified size distribution with the same power-law prefactor but a different cutoff. The density of the infinite cluster, known as the percolation probability \theta(p) = P_\infty(p), behaves as \theta(p) \sim (p - p_c)^\beta for p > p_c, where \beta is another critical exponent. A key statistic is the mean cluster size \chi(p), defined as the average size of the cluster containing a randomly chosen occupied site: \chi(p) = \sum_s s^2 n_s(p) / \sum_s s n_s(p). This quantity diverges at criticality as \chi(p) \sim |p - p_c|^{-\gamma}, with \gamma a critical exponent, signaling the growth of large clusters as the system approaches the percolation threshold. These statistics highlight the abrupt change in connectivity at p_c, where the system transitions from isolated finite clusters to a spanning infinite one.

Critical Phenomena and Scaling

Phase Transitions

The percolation transition represents a paradigmatic example of a continuous, or second-order, phase transition in statistical physics, occurring at the critical occupation probability p_c where the system undergoes a qualitative change from disconnected finite clusters to the emergence of a spanning infinite cluster. This analogy to thermodynamic phase transitions is drawn because, like magnetization in the Ising model, the connectivity properties exhibit singular behavior near p_c, with no latent heat but divergent response functions. The order parameter \theta(p), defined as the probability that a randomly chosen site belongs to the infinite cluster, vanishes continuously for p \leq p_c and scales as \theta(p) \sim (p - p_c)^\beta for p > p_c, where \beta > 0 is a critical exponent characterizing the strength of the transition. Near the critical point, several key quantities display power-law divergences or vanishings governed by universal critical exponents. The correlation length \xi, which measures the typical size of connected clusters and governs the exponential decay of connectivity between sites separated by distance r via \sim e^{-r/\xi}, diverges as \xi \sim |p - p_c|^{-\nu}. The susceptibility, analogous to the mean cluster size excluding the infinite cluster, diverges as \chi \sim |p - p_c|^{-\gamma} below and above p_c, reflecting enhanced fluctuations. Additionally, the distribution of finite cluster sizes at criticality follows n_s \sim s^{-\tau}, where s is the cluster size and \tau > 2 ensures a finite mean size, linking back to cluster statistics as the foundation for these scaling behaviors. These exponents \beta, \gamma, \nu, and \tau are interrelated through scaling relations derived from the hypothesis that singular behavior is controlled by \xi. A crucial aspect of these critical phenomena is the hyperscaling relation $2 - \alpha = d \nu, where \alpha is the exponent for the singular part of the "free energy" analog (related to the density of clusters), and d is the spatial dimension. This relation holds only below the upper critical dimension d_c = 6, above which mean-field theory applies and hyperscaling fails due to the dominance of long-range correlations. In dimensions d < 6, hyperscaling connects the exponents to the geometry of the system, ensuring consistency with the fractal nature of critical clusters. In practical simulations of percolation on finite lattices of linear size L, the transition is rounded, and the effective critical point shifts as p_c(L) - p_c \sim L^{-1/\nu}, allowing extrapolation to the thermodynamic limit through finite-size scaling analysis. This shift arises because the correlation length cannot exceed L, so the system's behavior mimics criticality when \xi \approx L, providing a powerful numerical tool to estimate exponents and p_c.

Universality and Fractal Geometry

In percolation theory, universality refers to the observation that critical phenomena near the percolation threshold exhibit the same scaling behavior across diverse models, provided they share the same spatial dimensionality and underlying symmetry. For instance, site percolation, bond percolation, and continuum percolation on lattices with equivalent connectivity in two dimensions belong to the same universality class, where critical exponents are independent of specific microscopic details such as lattice type or occupation mechanism. This principle arises from the renormalization group framework, which shows that short-range correlations dominate the long-distance critical behavior. In two dimensions, exact values for key exponents have been established through conformal invariance and Schramm-Loewner evolution (SLE). The order parameter exponent β equals 5/36, characterizing the probability of belonging to the infinite cluster as P_∞ ∼ (p - p_c)^β for p > p_c.^[25] The correlation length exponent ν is 4/3, governing the divergence of the typical cluster size ξ ∼ |p - p_c|^{-ν}. Above the upper critical dimension d_c = 6, percolation enters the mean-field regime, where exponents take classical values: β = 1, describing a continuous onset of the infinite cluster with linear scaling of the order parameter, and the susceptibility exponent γ = 1, for the mean cluster size divergence. These classes highlight how dimensionality dictates shared critical properties, with intermediate dimensions (3 ≤ d < 6) showing non-mean-field behavior via numerical renormalization.^[26] At the critical point p_c, the incipient infinite cluster displays fractal geometry, embedding in d-dimensional space with a fractal dimension D_f < d, reflecting its self-similar, ramified structure. The fractal dimension is given by the hyperscaling relation

D_f = d - \frac{\beta}{\nu},

which relates mass scaling M(r) ∼ r^{D_f} within a radius r to the critical exponents. In two dimensions, substituting β = 5/36 and ν = 4/3 yields D_f = 91/48 ≈ 1.895, confirmed analytically via SLE mappings from the 1980s.^[25] The backbone of this cluster—the subset of bonds carrying current between distant points—possesses a lower fractal dimension D_b < D_f, excluding dead-end branches and emphasizing multiply connected paths; numerical estimates place D_b ≈ 1.64 in 2D. Additionally, the external perimeter or hull of the infinite cluster traces a fractal boundary with dimension 7/4, derived from Coulomb gas mappings of the percolation interfaces. This hull exponent governs the roughness of the cluster's outer edge, distinguishing it from the internal filled perimeter and underscoring the geometric multiplicity in critical percolation.

Applications and Examples

In Physics and Materials

In physics and materials science, percolation theory provides a framework for understanding transport properties in disordered systems, particularly how connectivity emerges to enable macroscopic flow or conduction. A key application is in resistor networks, where sites or bonds are randomly occupied with probability p, modeling heterogeneous conductors. Above the percolation threshold p_c, the effective conductivity \sigma scales as \sigma \sim (p - p_c)^t, with the critical exponent t \approx 1.3 in two dimensions for bond percolation on square lattices and t = 3 in the mean-field limit for dimensions d \geq 6.^[27]^[28] This scaling captures the dramatic increase in conductivity as a spanning cluster forms, as first systematically explored in random resistor models.^[12] Percolation also informs fluid transport in porous media, where near p_c, the permeability deviates from classical Darcy's law due to the fractal nature of the percolating paths, leading to anomalous flow rates that scale with powers of (p - p_c). In composite materials, such as polymers filled with conductive particles like carbon black, percolation governs the transition from insulating to conductive behavior; for instance, low loadings of carbon black (around 10-20 wt%) can achieve high conductivity via network formation, enabling applications in antistatic coatings and sensors.^[29]^[30] In polymer physics, gelation—the sol-to-gel transition—parallels percolation, with the Flory-Stockmayer theory providing a mean-field description where the gel fraction emerges at a critical cross-link density, akin to the infinite cluster probability \beta = 1 exponent. Similarly, in granular superconducting films, percolation models the superconductor-insulator transition, where Josephson coupling across metallic grains leads to zero-resistance states above p_c, with critical currents scaling near the threshold.^[12] Practical examples include enhanced oil recovery in reservoirs, where injected fluids follow percolating pathways through porous rock, allowing predictions of breakthrough times and recovery efficiency via scaling laws. Dielectric breakdown in insulators, such as gate oxides, is modeled as percolation of defect paths under electric fields, explaining time-dependent failure statistics and Weibull distributions in microelectronics.^[31]^[32] Recent advances, as of 2025, leverage percolation in two-dimensional materials like graphene for flexible electronics; hybrid graphene-polymer composites exhibit tunable conductivity thresholds as low as 0.5 vol%, enabling stretchable sensors and wearables with enhanced mechanical compliance.^[33]^[34] In epidemiology, percolation theory provides a framework for understanding disease spread thresholds in models like the susceptible-infected-recovered (SIR) framework, where the basic reproduction number R_0 > 1 corresponds to the occupation probability p exceeding the percolation threshold p_c, leading to a giant connected component of infected individuals analogous to epidemic outbreaks.^[35]^[36] This mapping allows percolation to predict the emergence of large-scale transmission clusters on contact networks, with the SIR model's isotropic percolation universality class capturing the absorbing-state phase transition from localized to percolating infections.^[37] For instance, bond percolation on random graphs extends SIR dynamics to incorporate network heterogeneity, estimating critical thresholds for interventions like vaccination to prevent percolation.^[38] In virology, percolation models describe the assembly and disassembly of viral capsids, where the removal of protein subunits triggers a phase transition akin to percolation collapse, destabilizing the icosahedral structure when connectivity falls below a critical fraction.^[39] Graph-theoretic percolation analysis of capsid networks reveals that fragmentation occurs through dissociation of tiles or clusters, with the percolation threshold determining stability during viral lifecycle stages like uncoating in host cells.^[40] This approach highlights how biophysical properties, such as subunit interactions, influence the efficiency of capsid formation in viruses like HIV or bacteriophages.^[41] Percolation theory also applies to neural systems, modeling synaptic connectivity in living networks where reducing synaptic strength induces a percolation transition, fragmenting the graph into disconnected components and altering information propagation.^[42] In cortical cultures, this manifests as a critical point where excitatory-inhibitory balance optimizes network efficiency and robustness, with percolation explaining the emergence of functional clusters under homeostatic plasticity.^[43]^[44] Such models reveal how synaptic scaling maintains percolation near criticality, supporting economical wiring in brain tissue.^[45] In social systems, percolation captures information spread and rumor propagation on graphs, where bootstrap percolation variants model activation cascades triggered by trusted connections, leading to rapid dissemination if initial seeds exceed a threshold.^[46] For rumors, multi-type bootstrap processes simulate gossip dynamics, with trust levels determining closure probabilities and giant components forming above percolation thresholds in heterogeneous networks.^[47] Traffic jamming represents an inverse percolation process, where congestion clusters grow until network fragmentation occurs, reducing overall flow as links (roads) become blocked beyond a critical density.^[48] During the COVID-19 pandemic, percolation analysis of contact networks identified thresholds for containment, showing that mobility restrictions below p_c fragmented transmission clusters, preventing giant outbreaks in hierarchical mobility graphs.^[49] Post-2020 studies applied site-bond percolation to household and community structures, revealing that vaccination and bubbling strategies raise effective p_c, limiting percolation across superspreading events.^[50]^[51] This framework underscored how non-pharmaceutical interventions mimic bond removal to suppress epidemic percolation.^[52]

References

[1]
[PDF] Percolation Theory - MIT
Oct 9, 2002 · Percolation theory is the simplest model displaying a phase transition. The analytic solutions to 1d and mean-field percolation are presented.
[2]
[PDF] Percolation processes
Oct 24, 2008 · ABSTRACT. The paper studies, in a general way, how the random properties of a 'medium' influence the percolation of a ' fluid' through it.
[3]
[PDF] A mini course on percolation theory
Percolation is a probability model with critical phenomena, where a parameter changes behavior. It uses a lattice with edges open with probability p.
[4]
An introduction to percolation theory: Advances in Physics
Jun 2, 2006 · Percolation theory is the theory of classical particles interacting with a random medium, exhibiting critical behavior.
[5]
Fluid leakage near the percolation threshold | Scientific Reports
Feb 3, 2016 · Percolation is a concept widely used in many fields of research and refers to the propagation of substances through porous media (e.g. ...
[6]
Understanding Percolation in Soil and Its Impact on Groundwater
Nov 11, 2023 · Percolation is the natural process where water moves vertically downward through soil and rock layers under the influence of gravity.Missing: definition | Show results with:definition
[7]
[PDF] Sixty years of percolation - arXiv
Dec 13, 2017 · Percolation models describe the inside of a porous material. The theory emerged timidly in the middle of the twentieth century before becoming ...Missing: seminal | Show results with:seminal
[8]
Continuum percolation (Chapter 8) - Cambridge University Press
In the first section we present the most basic model of continuum percolation, the Gilbert disc model or Boolean model, and give some fundamental results on it, ...
[9]
Percolation processes | Mathematical Proceedings of the ...
The paper studies, in a general way, how the random properties of a 'medium' influence the percolation of a 'fluid' through it.
[10]
[PDF] PERCOLATION AND RANDOM GRAPHS - of Remco van der Hofstad
While in percolation, the random network considered naturally lives on an infinite graph, in random graph theory one considers random finite graphs. Thus, all ...<|control11|><|separator|>
[11]
Percolation and Conduction | Rev. Mod. Phys.
Oct 1, 1973 · Extensions of percolation theory to treat transport are described. Resistor networks, from which resistors are removed at random, provide the natural ...<|separator|>
[12]
[PDF] Exact percolation probabilities for a square lattice - arXiv
Mar 31, 2022 · Thus, currently, the most accurate value of the percolation threshold for site percolation on a square lattice p𝑐 = 0.592 746 050 792 10(2) has ...
[13]
[PDF] Percolation theory - arXiv
Jul 11, 2005 · Percolation as a mathematical theory was intro- duced by Broadbent and Hammersley [4], as a stochastic way of modeling the flow of a fluid ...<|separator|>
[14]
[PDF] arXiv:0708.3250v3 [cond-mat.stat-mech] 13 Jan 2008
Jan 13, 2008 · Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite.
[15]
[PDF] arXiv:1512.02579v1 [cond-mat.dis-nn] 8 Dec 2015
Dec 8, 2015 · If sites or bonds are occupied with some probability p, the percolation threshold is the minimum value of p at which there is a connected path ...
[16]
[PDF] SQUARE LATTICE SITE PERCOLATION THRESHOLDS FOR ...
for example: 1D chain of sites (pc = 1) [3], the.
[17]
High-density percolation: Exact solution on a Bethe lattice
The classical percolation critical exponentsβ=gg=1 are found. The percolation thresholds vary between the ordinary percolation thresholdp c (m=1)=l/(z − 1) andp ...<|separator|>
[18]
Mean-Field Critical Behaviour for Percolation in High Dimensions
The triangle condition is known to imply that various critical exponents take their mean-field (Bethe lattice) values. (y = β = 1,δ = Δt = 2, ί ^ 2) and that ...
[19]
The critical probability of bond percolation on the square lattice ...
The critical probability of bond percolation on the square lattice equals 1/2 · 1166 Accesses · 491 Citations · 30 Altmetric · 3 Mentions · Explore all metrics ...
[20]
[1302.0421] Bond and Site Percolation in Three Dimensions - arXiv
Feb 2, 2013 · We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds.
[21]
Percolation Phenomena in Higher Dimensions: Approach to the ...
Jan 12, 1976 · Percolation thresholds in two to six dimensions are studied by Monte Carlo methods in order to test Toulouse's recent conjecture that at six ...
[22]
Series Expansion of the Percolation Threshold on Hypercubic Lattices
May 7, 2018 · We study proper lattice animals for bond- and site-percolation on the hypercubic lattice \mathbb{Z}^d to derive asymptotic series of the percolation threshold ...Missing: estimation | Show results with:estimation
[23]
Efficient Monte Carlo algorithm and high-precision results for ... - arXiv
May 16, 2000 · We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities ...
[24]
https://arxiv.org/abs/cond-mat/0005264
[25]
Percolation thresholds and Fisher exponents in hypercubic lattices
Aug 22, 2018 · For the mean-field solution on the Bethe lattice, we have β = γ = 1 and ν = 1 2 , which implies d c = 6 . Rigorous results provide only upper ...
[26]
The conductivity of large percolation network samples - IOPscience
The method is applied to bond percolation on the square lattice where the conductivity exponent is found to be t=1.31+or-0.04, in agreement with recent results ...
[27]
[PDF] arXiv:0710.1105v1 [cond-mat.stat-mech] 4 Oct 2007
Oct 4, 2007 · the mean-field value of the conductance exponent t = 3 [34,38,39]. Scaling also determines the conductance of a finite-size system of linear ...
[28]
Flow, Transport, and Reaction in Porous Media: Percolation Scaling ...
Oct 4, 2017 · Percolation theory provides a framework for calculating flow and transport properties of porous media The direct predictions of percolation ...
[29]
Aggregate structure and percolation behavior in polymer/carbon ...
Oct 17, 2007 · The percolation behavior and mechanisms of electrical conductivity in carbon black filled polymer composites were analyzed.
[30]
Predicting oil recovery using percolation theory - Lyell Collection
In this paper we apply scaling laws from percolation theory to the problem of estimating the time for a fluid injected into an oil field to breakthrough ...
[31]
Percolation models for gate oxide breakdown - AIP Publishing
Nov 15, 1999 · Computer calculations of the formation of a percolation path across a finite lattice are used to model dielectric breakdown.
[32]
Research progress on the application of two-dimensional materials ...
Aug 14, 2025 · This work focuses on these three materials, transcending traditional methodological limitations. Grounded in percolation theory and interface ...
[33]
Explosive percolation yields highly-conductive polymer ... - NIH
Nov 11, 2022 · Here the authors exploit explosive percolation to realize a low-loading composite material with enhanced electrical properties by in-situ reduction of graphene ...
[34]
Infection Percolation: A Dynamic Network Model of Disease Spreading
Percolation theory provides another powerful way to explore disease spreading throughout a social network composed of discrete, spatially-separated individuals, ...
[35]
Predicting the epidemic threshold of the susceptible-infected ...
Apr 19, 2016 · Researchers have developed several theoretical methods for predicting epidemic thresholds, including the mean-field like (MFL) method, the quenched mean-field ...
[36]
[PDF] Different universality classes of epidemiological models - MIT
As explained before, the SIS model is in the DP universality class, but the SIR model is in the isotropic percolation (IP) universality class.
[37]
Disease Transmission on Random Graphs Using Edge‐Based ...
Apr 14, 2025 · We will derive threshold results for the network-SIR model using percolation methods, which is a common approach to analytically connect ...
[38]
The Percolation Phase Transition (Collapse) in Virus Capsids - NIH
Capsid disassembly is critical to the lifecycles of many viruses yet is poorly understood. Here, we apply a graph- and percolation theory to examine the effect ...
[39]
Percolation Theory Reveals Biophysical Properties of Virus-like ...
Jul 23, 2021 · Percolation Theory for Viral Capsids Capsid fragmentation occurs via any dissociation of single units (tiles) or smaller clusters from the bulk ...
[40]
the percolation phase transition (collapse) in virus capsids
Here, we apply a graph and percolation theory to examine the effect of removing capsid subunits on capsid stability and fragmentation. Based on the structure of ...
[41]
Percolation in Living Neural Networks | Phys. Rev. Lett.
Oct 30, 2006 · Neural connectivity is lowered by reducing the synaptic strength, chemically blocking neurotransmitter receptors. We use a graph-theoretic ...
[42]
Percolation may explain efficiency, robustness, and economy of the ...
Percolation, controlled by synaptic E/I balance, explains brain efficiency, robustness, and economy. An optimal 1:1 E/I balance ensures these properties.
[43]
Percolation in networks with local homeostatic plasticity - Nature
Jan 10, 2022 · Here we study percolation in networks that actively respond to link damage by adopting a mechanism resembling synaptic scaling in neurons.
[44]
Development of input connections in neural cultures - PNAS
Sep 16, 2008 · The percolation approach in our case deals with changes in the connections of the neuronal network, which can be gradually weakened by means of ...<|separator|>
[45]
A trust model for spreading gossip in social networks: a multi-type ...
Mar 11, 2020 · We introduce here a multi-type bootstrap percolation model, which we call T -Bootstrap Percolation ( T -BP), and apply it to study information propagation in ...Missing: rumor | Show results with:rumor
[46]
A Trust Model for Spreading Gossip in Social Networks: A Multi-Type ...
We introduce here a multi-type bootstrap percolation model, which we call T -Bootstrap Percolation ( T -BP), and apply it to study information propagation ...Missing: rumor | Show results with:rumor
[47]
Robustness response of the Zurich road network under different ...
The inverse percolation transition describes the fragmentation process of a network. The robustness criterion is to progressively remove nodes or edges from ...<|separator|>
[48]
Percolation of temporal hierarchical mobility networks during COVID ...
We examine percolation on both levels and demonstrate the changes of network metrics and the connected components under the influence of COVID-19.
[49]
Highlighting the impact of social relationships on the propagation of ...
Dec 21, 2021 · We develop a site-bond percolation model, called PERCOVID, in order to describe the time evolution of all epidemics propagating through respiratory tract or by ...
[50]
(PDF) Household bubbles and COVID-19 transmission: insights ...
For each bubbling scenario, we calculated the percolation threshold, that is, the number of connections per individual required for a giant component to form, ...
[51]
Percolation and the pandemic - ScienceDirect.com
An epidemic is a percolation process gone out of control, that is, going beyond the critical transition threshold.<|control11|><|separator|>