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

  title={The computation of bond percolation critical polynomials by the deletion–contraction algorithm},
  author={Christian R Scullard},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  • C. Scullard
  • Published 13 July 2012
  • Computer Science
  • Journal of Statistical Mechanics: Theory and Experiment
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 extended to any periodic lattice. The polynomial is computed on a finite subgraph, called the base, of an infinite lattice. For any problem with exactly known solution, the prediction of the bond threshold is always correct for any base containing an arbitrary number of unit cells. For unsolved… 
4 Citations

Transfer matrix computation of generalized critical polynomials in percolation

Percolation thresholds have recently been studied by means of a graph polynomial PB(p), henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial

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

Transfer matrix computation of critical polynomials for two-dimensional Potts models

In our previous work [1] we have shown that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial PB(q, v), henceforth referred to as the critical polynomial.

Phase diagram of the triangular-lattice Potts antiferromagnet

We study the phase diagram of the triangular-lattice Q-state Potts model in the real (Q,v)-plane, where v=eJ−1 is the temperature variable. Our first goal is to provide an obviously missing feature



Critical surfaces for general inhomogeneous bond percolation problems

We present a method of general applicability for finding exact values or accurate approximations of bond percolation thresholds for a wide class of lattices. To every lattice we systematically

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.

Exact bond percolation thresholds in two dimensions

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs,

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.

Critical manifold of the kagome-lattice Potts model

Any two-dimensional infinite regular lattice G can be produced by tiling the plane with a finite subgraph B⊆G; we call B a basis of G. We introduce a two-parameter graph polynomial PB(q, v) that

Critical frontier of the Potts and percolation models on triangular-type and kagome-type lattices. II. Numerical analysis.

Numerical determination of critical properties such as conformal anomaly and magnetic correlation length verifies that the universality principle holds and infers that the homogeneity assumption determines critical frontiers with an accuracy of 5 decimal places or higher.

Percolation on Self-Dual Polygon Configurations

Recently, Scullard and Ziff noticed that a broad class of planar percolation models are self-dual under a simple condition that, in a parametrized version of such a model, reduces to a single

Low-density series expansions for directed percolation: I. A new efficient algorithm with applications to the square lattice

A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the

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.

Using Symmetry to Improve Percolation Threshold Bounds

It is shown that symmetry, represented by a graph's automorphism group, can be used to greatly reduce the computational work for the substitution method, resulting in tighter bounds on the percolation threshold $p_c$.