Related papers: Bond and Site Percolation in Three Dimensions
We use the connection between bond percolation and SIR epidemics to establish lower bounds for the critical percolation probability in $2$ and $3$ dimensions as the range becomes large. The bound agrees with the conjectured asymptotics for…
We expand the critical point for site percolation on the $d$-dimensional hypercubic lattice in terms of inverse powers of $2d$, and we obtain the first three terms rigorously. This is achieved using the lace expansion.
Using 20 months of CPU time on our special purpose computer ``Percola'' we determined the exponent for the normal conductivity at the threshold of three-dimensional site and bond percolation. The extrapolation analysis taking into account…
We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…
In two space dimensions, the percolation point of the pure-site clusters of the Ising model coincides with the critical point T_c of the thermal transition and the percolation exponents belong to a special universality class. By introducing…
A 1/L-expansion for percolation problems is proposed, where L is the lattice finite length. The square lattice with 27 different sizes L = 18, 22 ... 1594 is considered. Certain spanning probabilities were determined by Monte Carlo…
We study a percolation model with restrictions on the opening of sites on the square lattice. In this model, each site $s \in \mathbb{Z}^{2}$ starts closed and an attempt to open it occurs at time $t=t_s$, where $(t_s)_{s \in \mathbb{Z}^2}$…
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…
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 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…
We study the effect of positive correlations on the critical threshold of site and bond percolation in a square lattice with d = 2. We propose two algorithms for generating dependent lattices with minimal correlation length and non-negative…
We present a Monte Carlo study of the bond and site directed (oriented) percolation models in $(d+1)$ dimensions on simple-cubic and body-centered-cubic lattices, with $2 \leq d \leq 7$. A dimensionless ratio is defined, and an analysis of…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical…
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$.
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…
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…
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…
While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…
In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…