Related papers: Subcritical $\mathcal{U}$-bootstrap percolation mo…
The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…
Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…
Bootstrap percolation on a graph with infection threshold $r\in \mathbb{N}$ is an infection process, which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes…
We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the…
We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…
We study level-set percolation for the harmonic crystal on $\mathbb{Z}^d$, $d \geq 3$, with uniformly elliptic random conductances. We prove that this model undergoes a non-trivial phase transition at a critical level that is almost surely…
Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…
In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture…
We consider the set of points visited by the random walk on the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, for $d \geq 3$, at times of order $uN^d$, for a parameter $u>0$ in the large-$N$ limit. We prove that the vacant set left by the…
We give an example of an invariant bond percolation process on the slab $\mathbb{Z}^2\times \{0,1\}$ with the property that it has infinitely many clusters whose critical percolation probability is strictly less than $1$. We also show that…
We consider bootstrap percolation on the binomial random graph $G(n,p)$ with infection threshold $r\in \mathbb{N}$, an infection process which starts from a set of initially infected vertices and in each step every vertex with at least $r$…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^d$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,\dots,…
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,…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
For the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation…
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 prove, using the random-cluster model, a strict inequality between site percolation and magnetization in the region of phase transition for the d-dimensional Ising model, thus improving a result of [CNPR76]. We extend this result also at…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…