Related papers: Near-critical percolation with heavy-tailed impuri…
We study two closely related processes on the triangular lattice: frozen percolation, where connected components of occupied vertices freeze (they stop growing) as soon as they contain at least $N$ vertices, and forest fire processes, where…
Let $T$ be a regular rooted tree. For every natural number $n$, let $B_n$ be the finite subtree of vertices with graph distance at most $n$ from the root. Consider the following forest-fire model on $B_n$: Each vertex can be "vacant" or…
We study forest fire processes in two dimensions. On a given planar lattice, vertices independently switch from vacant to occupied at rate $1$ (initially they are all vacant), and any connected component "is burnt" (its vertices become…
We consider a forest-fire model which, somewhat informally, is described as follows: Each site (vertex) of the square lattice is either vacant or occupied by a tree.Vacant sites become occupied at rate 1. Further, each site is hit by…
We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…
In the classical Drossel-Schwabl forest fire process, vertices of a lattice become occupied at rate $1$, and they are hit by lightning at some tiny rate $\zeta > 0$, which causes entire connected components to burn. In this paper, we study…
Consider the following forest-fire model on the upper half-plane of the triangular lattice: Each site can be "vacant" or "occupied by a tree". At time 0 all sites are vacant. Then the process is governed by the following random dynamics:…
Self-destructive percolation with parameters $p,\delta$ is obtained by taking a site percolation configuration with parameter $p$, closing all sites belonging to infinite clusters, then opening every closed site with probability $\delta$,…
We consider a version of the forest fire model on graph $G$, where each vertex of a graph becomes occupied with rate one. A fixed vertex $v_0$ is hit by lightning with the same rate, and when this occurs, the whole cluster of occupied…
A few years ago two of us introduced, motivated by the study of certain forest-fireprocesses, the self-destructive percolation model (abbreviated as sdp model). A typical configuration for the sdp model with parameters p and delta is…
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…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We include immunity against fire as a new parameter into the self-organized critical forest-fire model. When the immunity assumes a critical value, clusters of burnt trees are identical to percolation clusters of random bond percolation. As…
We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…
One of the most well-known classical results for site percolation on the square lattice is the equation $p_c+p_c^*=1$. In words, this equation means that for all values $\neq p_c$ of the parameter $p$, the following holds: either a.s. there…
We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…
We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…
We introduce a non-standard model for percolation on the integer lattice $\mathbb Z^2$. Randomly assign to each vertex $a \in \mathbb Z^2$ a potential, denoted $\phi_a$, chosen independently and uniformly from the interval $[0, 1]$. For…
On the lattice $\widetilde{\mathbb Z}^2_+:={(x,y)\in \mathbb Z \times \mathbb Z_+\colon x+y \text{is even}}$ we consider the following oriented (northwest-northeast) site percolation: the lines $H_i:={(x,y)\in \widetilde {\mathbb Z}^2_+…