相关论文: Percolation on two- and three-dimensional lattices

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…

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…

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…

The results of investigations of main characteristics of a one-dimensional percolation theory (percolation threshold, critical exponents of correlation radius and specific heat, and free energy) are presented for the problem of bonds and…

We report the critical point for site percolation for the "explosive" type for 2D square lattices using Monte Carlo simulations and compare it to the classical well known percolation. We use similar algorithms as have been recently reported…

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…

The localization transition and the critical properties of the Lorentz model in three dimensions are investigated by computer simulations. We give a coherent and quantitative explanation of the dynamics in terms of continuum percolation…

We present an alternative geometric representation for the eleven Archimedean lattices, in which each site and bond is uniquely labeled by an ordered pair of integers and characterized via a modular function. This structured labeling…

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…

We collect together results for bond percolation on various lattices from two to fourteen dimensions which, in the limit of large dimension $d$ or number of neighbors $z$, smoothly approach a randomly diluted Erd\H{o}s-R\'enyi graph. We…

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…

We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…

This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the…

We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…

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.

Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…

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 study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation…

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}

We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate…