Related papers: $\mathcal{U}$-bootstrap percolation: critical prob…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…
Stavskaya's model is a one-dimensional probabilistic cellular automaton (PCA) introduced in the end of the 1960's as an example of a model displaying a nonequilibrium phase transition. Although its absorbing state phase transition is well…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
Following H. Tomita and C. Murakami we propose an analytical model to predict critical probability of percolation. It is based on the excursion set theory which allows us to consider N-dimensional bounded regions. Details are given for the…
We study loop percolation models in two and in three space dimensions, in which configurations of occupied bonds are forced to form closed loop. We show that the uncorrelated occupation of elementary plaquettes of the square and the simple…
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…
The probability distributions of the order parameter for two models in the directed percolation universality class were evaluated. Monte Carlo simulations have been performed for the one-dimensional generalized contact process and the…
We study a percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…
We study the $N=3$ case of the $CP^{N-1}$ model, which is a field theory of $N$ complex scalars in $3d$ coupled to an Abelian gauge field with $SU(N) \times U(1)$ global symmetry. Recent evidence suggests the $N=2$ theory is not critical,…
Survival and percolation probabilities are most important quantities in the theory and in the application of growth models with spreading. We construct field theoretical expressions for these probabilities which are feasible for…
We compare the probabilities of arm events in two-dimensional invasion percolation to those in critical percolation. Arm events are defined by the existence of a prescribed color sequence of invaded and non-invaded connections from the…
We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
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…
K-core and bootstrap percolation are widely studied models that have been used to represent and understand diverse deactivation and activation processes in natural and social systems. Since these models are considerably similar, it has been…
For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…
The $r$-neighbour bootstrap percolation process on a graph $G$ starts with an initial set $A_0$ of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a…