Related papers: Alternative criterion for two-dimensional wrapping…
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].…
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 present a method for computing transition points of the random cluster model using a generalization of the Newman-Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is…
Mitra et al. [Phys. Rev. E 99 (2019) 012117] proposed a new percolation model that includes distortion in the square lattice and concluded that it may belong to the same universality class as the ordinary percolation. But the conclusion is…
In conventional site percolation, all lattice sites are occupied with the same probability. For a bipartite lattice, sublattice-selective percolation instead involves two independent occupation probabilities, depending on the sublattice to…
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…
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…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
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 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…
We study the bootstrap and diffusion percolation models in the simple-cubic (sc), body-centered cubic (bcc), and face-centered cubic (fcc) lattices using the Newman-Ziff algorithm. The percolation threshold and critical exponents were…
We propose two schemes to achieve fast realizations of spatially correlated percolation models. The schemes are shown to be efficient in complementary regimes of correlation phase space. They are combined with a generalized Newman-Ziff…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
The percolation threshold and wrapping probability $R_{\infty}$ for the two-dimensional problem of continuum percolation on the surface of a Klein bottle have been calculated by the Monte Carlo method with the Newman--Ziff algorithm for…
Rigidity Percolation is a crucial framework for describing rigidity transitions in amorphous systems. We present a new, efficient algorithm to study central-force Rigidity Percolation in two dimensions. This algorithm combines the Pebble…
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 consider the effects of spatial correlations in a two-dimensional site percolation model. By generalizing the Newman-Ziff Monte Carlo algorithm to include spatial correlations, percolation thresholds and fractal dimensions of percolation…
We study percolation as a critical phenomenon on a multifractal support. The scaling exponents of the the infinite cluster size ($\beta$ exponent) and the fractal dimension of the percolation cluster ($d_f$) are quantities that seem do not…
We investigate variations of the well-known Achlioptas percolation problem, which uses the method of probing sites when building up a lattice system, or probing links when building a network, ultimately resulting in the delay of the…
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…