Polynomial sequences for bond percolation critical thresholds
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4, 6, 12) and (34, 6) using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. 03021), implemented as a branching process of lattices. I find the estimates for the bond percolation thresholds, pc(4, 6, 12) = 0.69377849... and pc(34, 6) = 0.43437077..., compared with Parviainen’s numerical results of pc = 0.69373383... and pc = 0.43430621... . These deviations are of the order 10-5, as is standard for this method. Deriving thresholds in this way for a given lattice leads to a polynomial with integer coefficients, the root in [0, 1] of which gives the estimate for the bond threshold and I show how the method can be refined, leading to a series of higher order polynomials making predictions that likely converge to the exact answer. Finally, I discuss how this fact hints that for certain graphs, such as the kagome lattice, the exact bond threshold may not be the root of any polynomial with integer coefficients.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC52-07NA27344
- OSTI ID:
- 1399718
- Report Number(s):
- LLNL-JRNL-470576
- Journal Information:
- Journal of Statistical Mechanics, Vol. 2011, Issue 09; ISSN 1742-5468
- Publisher:
- IOP PublishingCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Transfer matrix computation of generalized critical polynomials in percolation
Bond percolation thresholds on Archimedean lattices from critical polynomial roots