Bond percolation thresholds on Archimedean lattices from critical polynomial roots

Abstract

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 magnitude more accurate than traditional techniques. Here we report the result of large parallel calculations to produce what we believe may become the reference values of bond percolation thresholds on the Archimedean lattices for years to come. For example, for the kagome lattice we find $p_{\mathrm{c}}=0.52440499916744820(1)$, whereas the best estimate using standard techniques is $p_{\mathrm{c}}=0.52440499(2)$. We further provide strong evidence that there are two classes of lattices: one for which the first three scaling exponents characterizing the finite-size corrections to $p_{\mathrm{c}}$ are $\Delta =6,7,8$, and another for which $\Delta =4,6,8$. We discuss the open questions related to the method, such as the full scaling law, as well as its potential for determining critical points of other models.

References in corpus (15)

• Critical Percolation in Finite Geometries
• A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice
• Exact Site Percolation Thresholds Using the Site-to-Bond and Star-Triangle Transformations
• Universality of finite-size corrections to the number of critical percolation clusters
• Exact bond percolation thresholds in two dimensions
• Estimation of Bond Percolation Thresholds on the Archimedean Lattices
• Critical surfaces for general bond percolation problems
• Critical manifold of the kagome-lattice Potts model
• Rigorous confidence intervals for critical probabilities
• Transfer matrix computation of critical polynomials for two-dimensional Potts models
• Critical surfaces for general inhomogeneous bond percolation problems
• Percolation in Finite Matching Lattices
• On the growth constant for square-lattice self-avoiding walks
• The percolation critical polynomial as a graph invariant
• Polynomial sequences for bond percolation critical thresholds

Cited by in corpus (14)

• Percolation and the pandemic
• Critical polynomials in the nonplanar and continuum percolation models
• Bond percolation on simple cubic lattices with extended neighborhoods
• Jamming and percolation of dimers in restricted-valence random sequential adsorption
• Exact Percolation Probability on the Square Lattice
• Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems
• Exact percolation probabilities for a square lattice: Site percolation on a plane, cylinder, and torus
• Percolation thresholds on high dimensional $D_n$ and dense packing lattices
• Percolation thresholds of randomly rotating patchy particles on Archimedean lattices
• Crossover from string to cluster dynamics following a field quench in spin ice
• Percolation in the two-dimensional Ising model
• Critical points of the random cluster model with Newman-Ziff sampling
• Site and bond percolation in linearly distorted triangular and square lattices
• Extended-range percolation in five dimensions