Topological estimation of percolation thresholds

  title={Topological estimation of percolation thresholds},
  author={Richard A. Neher and Klaus Mecke and Herbert Wagner},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount importance. For two-dimensional lattice graphs, we use the universal scaling form of the cluster size distributions to derive a relation between the mean Euler characteristic of the critical percolation patterns and the threshold density pc. From this relation, we… 

Figures and Tables from this paper

Geometric functionals of fractal percolation

Abstract Fractal percolation exhibits a dramatic topological phase transition, changing abruptly from a dust-like set to a system-spanning cluster. The transition points are unknown and difficult to


A number of bidimensional random structures with increasing densities are simulated to explore possible links between Euler-Poincare characteristic (EPC), or connectivity, and percolation threshold.

Site percolation on lattices with low average coordination numbers

We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: by simulating oxides

Homological percolation and the Euler characteristic.

The simulation results strongly indicate that the zeros of the expected Euler characteristic curve approximate the critical values for homological percolation.

The Influence of a Network's Spatial Symmetry, Topological Dimension, and Density on Its Percolation Threshold

The scientific novelty of the obtained results is that for different network structures, it was shown that the percolation threshold for the blocking of nodes problem could be represented as an additive set of invariant values, that is, as an algebraic sum, the value of the members of which is stored in the transition from one structure to another.

Percolation of binary disk systems: Modeling and theory.

Monte Carlo simulations and spanning probability are used to extend prior models into regions of higher polydispersity than those previously considered and a correlation to predict the percolation threshold for binary disk systems is proposed.

Continuum line-of-sight percolation on Poisson–Voronoi tessellations

Abstract In this work, we study a new model for continuum line-of-sight percolation in a random environment driven by the Poisson–Voronoi tessellation in the d-dimensional Euclidean space. The edges

Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations.

  • Adam BeckerR. Ziff
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
The results rule out the conjecture by Hsu and Huang that the bond thresholds are 2/3 and 1/3, respectively, but support the conjecture of Wierman that, for fully triangulated lattices other than the regular triangular lattice, the bond threshold is less than 2 sin pi/18 approximately 0.3473.



Fast Monte Carlo algorithm for site or bond percolation.

  • M. NewmanR. Ziff
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
An efficient algorithm is described that can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system.

Percolation, statistical topography, and transport in random media

A review of classical percolation theory is presented, with an emphasis on novel applications to statistical topography, turbulent diffusion, and heterogeneous media. Statistical topography involves

Criteria for evaluation of universal formulas for percolation thresholds.

  • J. WiermanD. Naor
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
A set of desirable criteria for universal formulas to satisfy is proposed, and which criteria are satisfied by two bond threshold formulas and two site threshold formulas most cited in the literature are investigated.

Precise determination of the critical percolation threshold for the three- dimensional ''Swiss cheese'' model using a growth algorithm

Precise values for the critical threshold for the three-dimensional “Swiss cheese” continuum percolation model have been calculated using extensive Monte Carlo simulations. These simulations used a

Critical Probabilities for Cluster Size and Percolation Problems

When particles occupy the sites or bonds of a lattice at random with probability p, there is a critical probability pc above which an infinite connected cluster of particles forms. Rigorous bounds

Exact Critical Percolation Probabilities for Site and Bond Problems in Two Dimensions

An exact method for determining the critical percolation probability, pc, for a number of two‐dimensional site and bond problems is described. For the site problem on the plane triangular lattice pc


We show how to combine Kesten's scaling relations, the determination of critical exponents associated to the stochastic Loewner evolution process by Lawler, Schramm, and Werner, and Smirnov's proof

Euler characteristic and related measures for random geometric sets

By an elementary calculation we obtain the exact mean values of Minkowksi functionals for a standard model of percolating sets. In particular, a recurrence theorem for the mean Euler characteristic

New critical frontiers for the potts and percolation models.

  • F. Y. Wu
  • Mathematics
    Physical review letters
  • 2006
We obtain the critical threshold for a host of Potts and percolation models on lattices having a structure which permits a duality consideration. The consideration generalizes the recently obtained

Improved site percolation threshold universal formula for two-dimensional matching lattices.

The formula is constructed from the Galam-Mauger square root formula for site thresholds, by a modification which makes it consistent with the theoretical relationship between percolation thresholds of matching pairs of lattices.