Related papers: Critical percolation on the kagome hypergraph
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…
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…
Lattices that can be represented in a kagome-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P_3, the probability that all three vertices in the triangle connect, and P_0, the…
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…
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…
In this paper, I compute the inhomogeneous (multi-probability) bond critical surfaces for the (4,6,12) and (3^4,6) lattices using the linearity approximation described in (Scullard and Ziff, J. Stat. Mech. P03021), implemented as a…
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…
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…
We consider the Potts model and the related bond, site, and mixed site-bond percolation problems on triangular-type and kagome-type lattices, and derive closed-form expressions for the critical frontier. For triangular-type lattices the…
We use very efficient algorithms to calculate low-density series for bond and site percolation on the directed triangular, honeycomb, kagom\'e, and $(4.8^2)$ lattices. Analysis of the series yields accurate estimates of the critical point…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by means of transfer-matrix calculations and Monte Carlo simulations. The lattices include the square, triangular, honeycomb kagome and diced…
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…
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…
We compute the critical polymials for the q-state Potts model on all Archimedean lattices, using a parallel implementation of the algorithm of (Jacobsen, J. Phys. A: Math. Theor. 47 135001) that gives us access to larger sizes than…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…