Estimation of bond percolation thresholds on the Archimedean lattices

@article{Parviainen2007EstimationOB,
  title={Estimation of bond percolation thresholds on the Archimedean lattices},
  author={Robert Parviainen},
  journal={Journal of Physics A: Mathematical and Theoretical},
  year={2007},
  volume={40},
  pages={9253 - 9258}
}
  • R. Parviainen
  • Published 17 April 2007
  • Mathematics
  • Journal of Physics A: Mathematical and Theoretical
We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff. 

Figures and Tables from this paper

Supplementary material: Topological estimation of percolation thresholds

This is supplementary material for the article arxiv:0708.3250. We provide an alternative introduction of the mean Euler Characteristic, additional examples and the percolation thresholds for

Bond percolation thresholds on Archimedean lattices from critical polynomial roots

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

Rigorous confidence intervals for critical probabilities.

  • O. RiordanM. Walters
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
In this work, the method of Balister, Bollobás, and Walters is used to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices.

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

Tight bounds for the bond percolation threshold of the (3, 122) lattice

Improved mathematically rigorous upper and lower bounds for the bond percolation threshold are established using the substitution method, in which stochastic ordering is checked using a network flow algorithm.

A Disproof of Tsallis' Bond Percolation Threshold Conjecture for the Kagome Lattice

The substitution method is used, which is based on stochastic ordering, to compare the probability distribution of connections in the homogeneous bond percolation model on the kagome lattice to those of an exactly-solved inhomogeneous bondPercolation models on the martini lattice.

Polynomial sequences for bond percolation critical thresholds

In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4, 6, 12) and (34, 6) lattices using the linearity approximation described in Scullard and Ziff (2010 J.

Topological estimation of percolation thresholds

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

The computation of bond percolation critical polynomials by the deletion–contraction algorithm

Although every exactly known bond percolation critical threshold is the root in [0,1] of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be

High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials

The critical curves of the q-state Potts model can be determined exactly for regular two-dimensional lattices G that are of the three-terminal type. This comprises the square, triangular, hexagonal

References

SHOWING 1-10 OF 21 REFERENCES

Determination of the bond percolation threshold for the Kagomé lattice

The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagome lattice (and its dual, the dice lattice). For this system, the hull walk is

Pairs of graphs with site and bond percolation critical probabilities in opposite orders

Rigorous confidence intervals for critical probabilities.

  • O. RiordanM. Walters
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
In this work, the method of Balister, Bollobás, and Walters is used to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices.

Predictions of bond percolation thresholds for the kagomé and Archimedean (3, 12(2)) lattices.

  • C. ScullardR. Ziff
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
Here we show how the recent exact determination of the bond percolation threshold for the martini lattice can be used to provide approximations to the unsolved kagomé and (3, 12(2)) lattices. We

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.

Generalized cell-dual-cell transformation and exact thresholds for percolation.

  • R. Ziff
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A general "cell-dual-cell" transformation is proposed, which allows in principle an infinite variety of lattices with exact percolation thresholds to be generated.

Pairs of graphs with connective constants and critical probabilities in the same order

An Archimedean lattice is a graph of a regular tiling of the plane, such that all corners are equivalent. A tiling is regular if all tiles are regular polygons: equilateral triangles, squares, et

Exact site percolation thresholds using a site-to-bond transformation and the star-triangle transformation.

  • C. Scullard
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
A correlated bond problem on the hexagonal lattice is solved by use of the star-triangle transformation and the site problem is solved, by a particular choice of correlations derived from a site-to-bond transformation, on the martini lattice.

Site percolation thresholds for Archimedean lattices.

  • P. SudingR. Ziff
  • Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1999
The values of p(c) for all 11 Archimedean lattices, as well as a number of nonuniform lattice, are found to be well correlated by a nearly linear function of a generalized Scher-Zallen filling factor.

Predictions of bind percolation thresholds for the Kagomé and Archimedean (3, 122) lattices

  • Phys. Rev. E
  • 2006