The computation of generalized percolation critical polynomials by the deletion-contraction algorithm
arXiv:1207.3340 · doi:10.1088/1742-5468/2012/11/P11011
Abstract
Although every exactly known bond percolation critical threshold is the root in 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, regardless of the base chosen. 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 Archimedean lattices, except the kagome which was considered in an earlier work. The polynomial estimates are generally within to of the numerical values, but the prediction for the lattice, though not exact, is not ruled out by simulations.
References in corpus (18)
- Critical Percolation in Finite Geometries
- Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice
- Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
- Exact bond percolation thresholds in two dimensions
- Determination of the bond percolation threshold for the Kagome lattice
- Estimation of Bond Percolation Thresholds on the Archimedean Lattices
- Crossing Probabilities and Modular Forms
- Critical surfaces for general bond percolation problems
- Rigorous confidence intervals for critical probabilities
- Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters
- New critical frontiers for the Potts and percolation models
- Critical frontier for the Potts and percolation models on triangular-type and kagome-type lattices II: Numerical analysis
- Critical surfaces for general inhomogeneous bond percolation problems
- Random Cluster Models on the Triangular Lattice
- Percolation on self-dual polygon configurations
- The percolation critical polynomial as a graph invariant
- Polynomial sequences for bond percolation critical thresholds
- Critical frontier of the Potts and percolation models in triangular-type and kagome-type lattices I: Closed-form expressions