• DOI:10.1088/1742-5468/2012/11/P11011
• Corpus ID: 118996099

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

@article{Scullard2012TheCO,
  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},
  year={2012},
  volume={2012}
}

• 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 problems, the polynomial is referred to as the generalized critical polynomial and provides an approximation that becomes more accurate with increasing number of bonds in the base, appearing to approach the exact answer. The polynomials are computed using the deletion–contraction algorithm, which quickly becomes intractable by hand for more than about 18 bonds. Here, I present generalized critical polynomials calculated with a computer program for bases of up to 36 bonds for all the unsolved Archimedean lattices, except the kagome lattice, which was considered in an earlier work. The polynomial estimates are generally within 10−5–10−7 of the numerical values, but the prediction for the (4,82) lattice, though not exact, is not ruled out by simulations.