Related papers: Site percolation thresholds and universal formulas…
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…
By means of Monte Carlo simulations, we study long-range site percolation on square and simple cubic lattices with various combinations of nearest neighbors, up to the eighth neighbors for the square lattice and the ninth neighbors for the…
We present a rough estimation -- up to four significant digits, based on the scaling hypothesis and the probability of belonging to the largest cluster vs. the occupation probability -- of the critical occupation probabilities for the…
Extensive Monte-Carlo simulations were performed to study bond percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered cubic (b.c.c.) lattices, using an epidemic kind of approach. These simulations provide…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: By simulating oxides with a mixture of 2-coordinated and…
In a recent paper, we have reported a universal power law for both site and bond percolation thresholds for any lattice of cubic symmetry. Extension to anisotropic lattices is discussed.
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
We use invasion percolation to compute highly-accurate numerical values for bond and site percolation thresholds p_c on the hypercubic lattice Z^d for d = 4,,,,,13. We also compute the Fisher exponent tau governing the cluster size…
We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx…
A power law is postulated for both site and bond percolation thresholds. The formula writes $p_c=p_0[(d-1)(q-1)]^{-a}d^{\ b}$, where $d$ is the space dimension and $q$ the coordination number. All thresholds up to $d\rightarrow \infty$ are…
Recently S.Galam and A.Mauger [Phys.Rev.E 56, 322 (1997); cond-mat/9706304 ] proposed an approximant which relates the bond and the site percolation threshold for a particular lattice. Their formula is based on a fit to exact and simulation…
In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold $p_c$ and the strength of percolation clusters $P_\infty$ for a square lattice with $(1,…
We use invasion percolation to compute numerical values for bond and site percolation thresholds $p_c$ (existence of an infinite cluster) and $p_u$ (uniqueness of the infinite cluster) of tesselations $\{P,Q\}$ of the hyperbolic plane,…
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…
Using Monte Carlo simulations on different system sizes we determine with high precision the critical thresholds of two families of directed percolation models on a square lattice. The thresholds decrease exponentially with the degree of…
We simulate directed site percolation on two lattices with 4 spatial and 1 time-like dimensions (simple and body-centered hypercubic in space) with the standard single cluster spreading scheme. For efficiency, the code uses the same…
I calculated the exact site and bond percolation probability on lattice-like graphs for given dimension d: site percolation probability is 1/d and bond percolation probability is 0.5(d-1)^{-1/2}
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
In a recent paper, we have reported a universal power law for both site and bond percolation thresholds in any Bravais lattice with q equivalent nearest neighbors in dimension d. We now extend it to three different classes of lattices which…