Related papers: Estimation of Bond Percolation Thresholds on the A…

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

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 propose very efficient algorithms for the bootstrap percolation and the diffusion percolation models by extending the Newman-Ziff algorithm of the classical percolation [M. E. J. Newman and R. M. Ziff, Phys. Rev. Lett. 85 (2000) 4104].…

We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…

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

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}),…

We use the method of Balister, Bollobas and Walters to give rigorous 99.9999% confidence intervals for the critical probabilities for site and bond percolation on the 11 Archimedean lattices. In our computer calculations, the emphasis is on…

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…

We obtain the critical threshold for a host of Potts and percolation models on lattices having a structure which permits a duality consideration. The consideration generalizes the recently obtained thresholds of Scullard and Ziff for bond…

Based on the differences between a spanning cluster and a wrapping cluster, an alternative criterion for testing wrapping percolation is provided for two-dimensional lattices. By following the Newman-Ziff method, the finite size scaling of…

Recent research on percolation has led to the construction of an infinite class of lattices for which the percolation thresholds can be determined exactly. We discuss the mathematical basis for the solutions of bond percolation models, and,…

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…

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 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 consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

In a recent article, Galam and Mauger proposed an invariant for site and bond percolation thresholds, based on known values for twenty lattices (Eur. Phys. J. B 1 (1998) 255-258). Here we give a larger list of values for more than forty…

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…

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…