Related papers: The continuum percolation threshold for interpenet…
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…
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…
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…
We consider two-dimensional percolation in the scaling limit close to criticality and use integrable field theory to obtain universal predictions for the probability that at least one cluster crosses between opposite sides of a rectangle of…
In this paper, the 60-year-old concept of long-range interaction in percolation problems introduced by Dalton, Domb, and Sykes, is reconsidered. With Monte Carlo simulation -- based on Newman-Ziff algorithm and finite-size scaling…
Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…
Porous materials made up of impermeable polyhedral grains constrain fluid flow to voids around the impenetrable constituent barrier particles. A percolation transition marks the boundary between assemblies of grains which contain system…
Using grand canonical Monte Carlo simulations, we investigate the percolation behavior of a square well fluid with an ultra-short range of attraction in three dimension (3D) and in confined geometry. The latter is defined through two…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…
We calculate the scaling exponents of the two-dimensional correlated percolation cluster's hull and unscreened perimeter. Correlations are introduced through an underlying correlated random potential, which is used to define the state of…
We present results of a high precision Monte Carlo simulation of dynamically triangulated random surfaces (up to $\approx$ 34,000 triangles) coupled to one scalar field ($c=1$). The mean square extent has been measured for different actions…
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…
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…
We consider a percolation model on square lattices with sites weighted by beta-distributed random variables $S\sim \mathrm{Beta}(a,b)$ with a positive real parameters $a>0$ and $b>0$. Using the Monte Carlo method, we estimate the…
We investigate geometric percolation and scaling relations in suspensions of nanorods, covering the entire range of aspect ratios from spheres to extremely slender needles. A new version of connectedness percolation theory is introduced and…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
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…
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…