Related papers: Percolation Perspective on Sites Not Visited by a …
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…
We consider a correlated site percolation problem on a cubic lattice of size $L^3$, with $16\le L\le 512$. The sites of an initially full lattice are removed by a random walk of ${\cal N}=uL^3$ steps. When the parameter $u$ crosses a…
We consider a $d$-dimensional correlated percolation problem of sites {\em not} visited by a random walk on a hypercubic lattice $L^d$ for $d=3$, 4 and 5. The length of the random walk is ${\cal N}=uL^d$. Close to the critical value…
The average number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all starting from the same origin in a disordered fractal is considered. This quantity $S_N(t)$ is the result of a double average: an…
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
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…
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…
This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…
Porous media are often modelled as systems of overlapping obstacles, which leads to the problem of two percolation thresholds in such systems, one for the porous matrix and the other one for the void space. Here we investigate these…
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…
We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not…
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}$…
We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…
We study loop erased random walk (LERW) on the percolation cluster, with occupation probability $p\geq p_c$, in two and three dimensions. We find that the fractal dimensions of LERW$_p$ is close to normal LERW in Euclidean lattice, for all…
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of the model. A model where clusters freeze when…
Numerical simulations and finite-size scaling analysis have been carried out to study the problem of inverse site percolation by the removal of $k \times k$ square tiles ($k^{2}$-mers) from square lattices. The process starts with an…
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…