Related papers: Percolation of even sites for enhanced random sequ…
The vacant set of random interlacements at level $u>0$, introduced in arXiv:0704.2560, is a percolation model on $\mathbb{Z}^d$, $d \geq 3$ which arises as the set of sites avoided by a Poissonian cloud of doubly infinite trajectories,…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We consider the reversible random sequential adsorption of line segments on a one-dimensional lattice. Line segments of length $l \geq 2$ adsorb on the lattice with a adsorption rate $K_a$, and leave with a desorption rate $K_d$. We…
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…
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 describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…
We study a lattice model where the coupling stochastically switches between repulsive (subtractive) and attractive (additive) at each site with probability p at every time instance. We observe that such kind of coupling stabilizes the local…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. We consider random sequential adsorption in which the empty sites of a graph are irreversibly occupied in…
Random sequential adsorption of linear and square particles with excluded volume interaction is studied numerically on planar lattices considering Gaussian distributions of lateral sizes of the incident particles, with several values of the…
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N$^2$), next nearest neighbors (N$^3$), next next nearest…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…
In $H$-percolation, we start with an Erd\H{o}s--R\'enyi graph ${\mathcal G}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing from ${\mathcal G}_{n,p}$ are eventually added. We…
In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0),…