Related papers: Square lattice site percolation thresholds for com…
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 evaluate the percolation threshold values for a realistic model of continuum segregated systems, where random spherical inclusions forbid the percolating objects, modellized by hard-core spherical particles surrounded by penetrable…
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…
We study gradient percolation for site percolation on the triangular lattice. This is a percolation model where the percolation probability depends linearly on the location of the site. We prove the results predicted by physicists for this…
We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…
A scaling theory is used to derive the dependence of the average number <k> of spanning clusters at threshold on the lattice size L. This number should become independent of L for dimensions d<6, and vary as log L at d=6. The predictions…
We consider the symmetries of coincidence site lattices of 3-dimensional cubic lattices. This includes the discussion of the symmetry groups and the Bravais classes of the CSLs. We derive various criteria and necessary conditions for…
We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…
We present the results of study of random sequential adsorption of linear segments (needles) on sites of a square lattice. We show that the percolation threshold is a nonmonotonic function of the length of the adsorbed needle, showing a…
We develop a method of constructing percolation clusters that allows us to build very large clusters using very little computer memory by limiting the maximum number of sites for which we maintain state information to a number of the order…
We prove that enhanced entanglement percolation via lattice transformation is possible even if the new lattice is more poorly connected in that: i) the coordination number (a local property) decreases, or ii) the classical percolation…
An universal invariant for site and bond percolation thresholds (p_{cs} and p_{cb} respectively) is proposed. The invariant writes {p_{cs}}^{1/a_s}{p_{cb}}^{-1/a_b}=\delta/d where a_s, a_b and \delta are positive constants,and d the space…
How does removal of sites by a random walk lead to blockage of percolation? To study this problem of correlated site percolation, we consider a random walk (RW) of $N=uL^d$ steps on a $d$-dimensional hypercubic lattice of size $L^d$ (with…
Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.
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 analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
In this article, we study a bond percolation model on a horizontally stretched square lattice, constructed by stretching the distances between the columns of $\mathbb{Z}_+^2$ according to a collection of independent and identically…