Determination of the bond percolation threshold for the Kagomé lattice

  title={Determination of the bond percolation threshold for the Kagom{\'e} lattice},
  author={Robert M. Ziff and Paul Nash Suding},
  journal={Journal of Physics A},
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 represented as a self-avoiding trail, or mirror-model trajectory, on the (3,4,6,4)-Archimedean tiling lattice. The result (one standard deviation of error) is not consistent with previously conjectured values. 

Tables from this paper

Upper and Lower Bounds for the Kagomé Lattice Bond Percolation Critical Probability

  • J. Wierman
  • Materials Science
    Combinatorics, Probability and Computing
  • 2003
The proof of these bounds uses the substitution method, comparing the percolative behaviour of the Kagomé lattice bond model with that of the exactly solved hexagonal lattices bond model via stochastic ordering.

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.

Site percolation and random walks on d-dimensional Kagomé lattices

The site percolation problem is studied on d-dimensional generalizations of the Kagome lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d

An Investigation of Site-Bond Percolation on Many Lattices

It is shown here that there are strong deviations from the known approximate equations in the line of threshold values, and an alternative parametrization is proposed that lies much closer to the numerical values.

Estimation of bond percolation thresholds on the Archimedean lattices

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.

Percolation transitions in two dimensions.

The amplitude of the power-law correction associated with X_{t2}=4 is found to be dependent on the orientation of the lattice with respect to the cylindrical geometry of the finite systems.

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

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

Calculation of Percolation Thresholds in High Dimensions for FCC, BCC and Diamond Lattices

Site and bond percolation thresholds are calculated for the face centered cubic, body centered cubic and diamond lattices in four, five and six dimensions. The results are used to study the behavior



Critical point of planar Potts models

The critical point of the Potts model is conjectured for the following planar lattices: (i) generalised (chequerboard) square lattice; (ii) Kagome lattice; (iii) triangular lattice with two- and

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

The efficient determination of the percolation threshold by a frontier-generating walk in a gradient

The frontier in gradient percolation is generated directly by a type of self-avoiding random walk. The existence of the gradient permits one to generate an infinite walk on a computer of finite

COMMENT: On the hull of two-dimensional percolation clusters

A recently proven equivalence between certain random walks with memory and the hull of percolation clusters in two dimensions is used to estimate the fractal dimension of the latter by means of Monte

Triangular lattice Potts models

In this paper we study the 3-state Potts model on the triangular lattice which has two- and three-site interactions. Using a Peierls argument we obtain a rigorous bound on the transition temperature,

Site percolation threshold for square lattice

In order to find out as precisely as possible the site percolation threshold in the square lattice, a Fortran high speed Monte Carlo program has been developed (2.2-2.4 mu s per site on CDC Cyber 76)

Diffusion in Lorentz lattice gas cellular automata: The honeycomb and quasi-lattices compared with the square and triangular lattices

We study numerically the nature of the diffusion process on a honeycomb and a quasi-lattice, where a point particle, moving along the bonds of the lattice, scatters from randomly placed scatterers on

Phase diagram of anisotropic planar Potts ferromagnets: a new conjecture

The exact phase diagram of the nearest-neighbour q-state Potts ferromagnet in the fully anisotropic 3-12 lattice is conjectured through a star-triangle transformation. It recovers all the available

Generation of percolation cluster perimeters by a random walk

A type of self-avoiding random walk whish generates the perimeter of two- dimensional lattice-percolation clusters is given. The algorithm has been simulated on a computer, yielding the mean

Conformal invariance and line defects in the two-dimensional Ising model

The quantum Ising chain with p equidistant defects is studied. The exact form of the Hamiltonian is found for an infinite number of sites. Using conformal invariance, generalised corner exponents are