Related papers: Large clusters in a correlated percolation model
Herein, we propose a site random cluster model by introducing an additional cluster weight in the partition function of the traditional site percolation. To simulate the model on a square lattice, we combine the color-assignation and the…
We build a multifractal object and use it as a support to study percolation. We identify some differences between percolation in a multifractal and in a regular lattice. We use many samples of finite size lattices and draw the histogram of…
Extensive Monte-Carlo simulations were performed to evaluate the excess number of clusters and the crossing probability function for three-dimensional percolation on the simple cubic (s.c.), face-centered cubic (f.c.c.), and body-centered…
We investigate the process of invasion percolation between two sites (injection and extraction sites) separated by a distance r in two-dimensional lattices of size L. Our results for the non-trapping invasion percolation model indicate that…
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…
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…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
In cluster tomography, we propose measuring the number of clusters $N$ intersected by a line segment of length $\ell$ across a finite sample. As expected, the leading order of $N(\ell)$ scales as $a\ell$, where $a$ depends on microscopic…
Two distinct distribution functions $P_{sp}(m)$ and $P_{ns}(m)$ of the scaled largest cluster sizes $m$ are obtained at the percolation threshold by numerical simulations, depending on the condition whether the lattice is actually spanned…
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…
The distribution of masses of clusters smaller than the infinite cluster is evaluated at the percolation threshold. The clusters are ranked according to their masses and the distribution $P(M/L^D,r)$ of the scaled masses M for any rank r…
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…
We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…
We study the $m=3$ bootstrap percolation model on a cubic lattice, using Monte Carlo simulation and finite-size scaling techniques. In bootstrap percolation, sites on a lattice are considered occupied (present) or vacant (absent) with…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
Numerical simulations and finite-size scaling analysis have been carried out to study the percolation behavior of straight rigid rods of length $k$ ($k$-mers) on two-dimensional square lattices. The $k$-mers, containing $k$ identical units…