Transfer matrix computation of generalized critical polynomials in percolation

DOI10.1088/1751-8113/45/49/494004MaRDI QIDQ4903601zbMATH OpenOpenAlexWikidataFDO

Authors Christian R. Scullard, Jesper Lykke Jacobsen

Publication date 23 January 2013

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.1451, https://www.osti.gov/biblio/1399712

zbMATH Keywords

hexagonal latticecritical polynomial

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Critical phenomena in equilibrium statistical mechanics (82B27) Percolation (82B43)

Abstract: Percolation thresholds have recently been studied by means of a graph polynomial $P_B(p)$, henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph $B$, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of $P_B(p)$ in $[0,1]$ either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of $B$. Initially $P_B(p)$ was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give an alternative probabilistic definition of $P_B(p)$, which allows for much more efficient computations, by using the transfer matrix, than was previously possible with contraction-deletion. We present bond percolation polynomials for the $(4,8^2)$, kagome, and $(3,12^2)$ lattices for bases of up to respectively 96, 162, and 243 edges, much larger than the previous limit of 36 edges using contraction-deletion. We discuss in detail the role of the symmetries and the embedding of $B$. For the largest bases, we obtain the thresholds $p_c(4,8^2)=\mathrm{0.676803329...}$, $p_c(mathrmkagome)=\mathrm{0.524404998...}$, $p_c(3,12^2)=\mathrm{0.740420798...}$, comparable to the best simulation results. We also show that the alternative definition of $P_B(p)$ can be applied to study site percolation problems.

Recommendations

• High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials
• Transfer matrix computation of critical polynomials for two-dimensional Potts models
• Critical percolation on the kagome hypergraph
• Tight bounds for the bond percolation threshold of the \((3,12^{2})\) lattice
• Potts-model critical manifolds revisited

Cited in

(17)

• Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
• Zeros of the 3-state Potts model partition function for the square lattice revisited
• A transfer matrix for the backbone exponent of two-dimensional percolation
• Critical points of Potts and \(\mathrm{O}(N)\) models from eigenvalue identities in periodic Temperley-Lieb algebras
• The three-state Potts antiferromagnet on plane quadrangulations
• A technique for the estimation of percolation thresholds in lattice systems: application to a problem of granular flow through an orifice
• High-precision percolation thresholds and Potts-model critical manifolds from graph polynomials
• Transfer matrix computation of critical polynomials for two-dimensional Potts models
• Mixed site-bond percolation in Archimedean \((3,12^2)\) lattices
• Phase diagram of the triangular-lattice Potts antiferromagnet
• Classical phase transitions in a one-dimensional short-range spin model
• Exact percolation probabilities for a square lattice: site percolation on a plane, cylinder, and torus
• New bounds for the site percolation threshold of the hexagonal lattice
• Critical points of the random cluster model with Newman–Ziff sampling
• A disproof of Tsallis' bond percolation threshold conjecture for the Kagome lattice
• On bond percolation threshold bounds for Archimedean lattices with degree three
• Critical percolation on the kagome hypergraph

This page was built for publication: Transfer matrix computation of generalized critical polynomials in percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903601)