Related papers: Polynomial sequences for bond percolation critical…

We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…

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…

Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized…

We present a general method for predicting bond percolation thresholds and critical surfaces for a broad class of two-dimensional periodic lattices, reproducing many known exact results and providing excellent approximations for several…

Here we show how the recent exact determination of the bond percolation threshold for the martini lattice can be used to provide approximations to the unsolved kagom\'e and (3,12^2) lattices. We present two different methods, one of which…

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…

We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome…

The hull-gradient method is used to determine the critical threshold for bond percolation on the two-dimensional Kagome lattice (and its dual, the dice lattice). For this system, the hull walk is represented as a self-avoiding trail, or…

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$,…

The critical curves of the q-state Potts model can be determined exactly for regular two-dimensional lattices G that are of the three-terminal type. Jacobsen and Scullard have defined a graph polynomial P_B(q,v) that gives access to the…

We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the…

We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie lattice with five different probabilities, a problem that does not appear at first to fall into any known solvable class. Although our…

We study bond percolation on the simple cubic (SC) lattice with various combinations of first, second, third, and fourth nearest-neighbors by Monte Carlo simulation. Using a single-cluster growth algorithm, we find precise values of the…

In a recent paper (arXiv:0911.2514), one of us (FYW) considered the Potts model and bond and site percolation on two general classes of two-dimensional lattices, the triangular-type and kagome-type lattices, and obtained closed-form…

Extensive Monte-Carlo simulations were performed in order to determine the precise values of the critical thresholds for site ($p^{hcp}_{c,S} = 0.199 255 5 \pm 0.000 001 0$) and bond ($p^{hcp}_{c,B} = 0.120 164 0 \pm 0.000 001 0$)…

We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…

We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

The site percolation thresholds p_c are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results p_c = 0.697043, honeycomb or (6^3), 0.807904 (3,12^{2}),…

Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently the critical polynomial $P_{\rm B}(p,L)$ was introduced for planar-lattice percolation models, where $p$ is the occupation…