Related papers: Lower limit of percolation threshold on a square l…
The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from…
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…
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N$^2$), next nearest neighbors (N$^3$), next next nearest…
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…
In this paper we compute the square lattice random sites percolation thresholds in case when sites from the 4th and the 5th coordination shells are included for neighbourhood. The obtained results support earlier claims, that (a) the…
The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds $p_c$ for…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
We determine thresholds $p_c$ for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their complex combinations. There are 31 distinct…
We determine thresholds $p_c$ for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN)…
Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…
In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling…
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…
In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours…
Porous media are often modelled as systems of overlapping obstacles, which leads to the problem of two percolation thresholds in such systems, one for the porous matrix and the other one for the void space. Here we investigate these…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N$^2$) interactions. Two strategies are suggested for a density $x$ of destroyed sites by a random attack at $p_c$. In the first one, a density $y$…
The asymptotic behavior of the percolation threshold $p_c$ and its dependence upon coordination number $z$ is investigated for both site and bond percolation on four-dimensional lattices with compact extended neighborhoods. Simple…
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…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
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…