Bond percolation thresholds on Archimedean lattices from critical polynomial roots

@article{Scullard2019BondPT,
  title={Bond percolation thresholds on Archimedean lattices from critical polynomial roots},
  author={Christian R Scullard and Jesper Lykke Jacobsen},
  journal={Physical Review Research},
  year={2019}
}
We present percolation thresholds calculated numerically with the eigenvalue formulation of the method of critical polynomials; developed in the last few years, it has already proven to be orders of magnitude more accurate than traditional techniques. Here we report the result of large parallel calculations to produce what we believe may become the reference values of bond percolation thresholds on the Archimedean lattices for years to come. For example, for the kagome lattice we find $p_{\rm c… 

Figures and Tables from this paper

Percolation thresholds of randomly rotating patchy particles on Archimedean lattices.

We study the percolation of randomly rotating patchy particles on 11 Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and

Critical percolation on the kagome hypergraph

We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this

Percolation thresholds for robust network connectivity

Four measures of robust network connectivity are defined, their interrelationships are explored, and the respective robust percolation thresholds for the 2D square lattice are evaluated.

Jamming and percolation of dimers in restricted-valence random sequential adsorption

This paper studies irreversible deposition of dimers onto bonds of the square and triangular lattices subjected to valence restrictions and explore how this restriction affects jamming densities and

Bond percolation on simple cubic lattices with extended neighborhoods.

The results show that the percolation thresholds of these and other three-dimensional lattices decrease monotonically with the coordination number z quite accurately according to a power-law p_{c}∼z^{-a} with exponent a=1.111.

References

SHOWING 1-10 OF 44 REFERENCES

Combinatorics

2. Count the number of edge colorings of a square, up to rotation and reflection. Give them all explicitly for m = 2. Now the group has eight elements: id, (1234), (13)(24), (1432), (13), (24),

On bond percolation threshold bounds for Archimedean lattices with degree three

Improved bounds are proved for bond percolation thresholds for certain Archimedean lattices using the substitution method with new comparisons between models and more efficient computational

A bond percolation critical probability determination based on the star-triangle transformation

The bond percolation critical probability of a planar graph with square and triangular faces, obtained by inserting a diagonal in every other face of the square lattice, is the root of

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

Percolation processes

ABSTRACT The paper studies, in a general way, how the random properties of a ‘medium’ influence the percolation of a ‘fluid’ through it. The treatment diifers from conventional diffusion theory, in

Theory of superconductivity

A theory of superconductivity is presented, based on the fact that the interaction between electrons resulting from virtual exchange of phonons is attractive when the energy difference between the