Related papers: Bootstrap percolation on a generalized Hamming cub…
In this paper, we consider nearest-neighbor oriented percolation with independent Bernoulli bond-occupation probability on the $d$-dimensional body-centered cubic (BCC) lattice $\mathbb{L}^d$ and the set of non-negative integers…
We analytically study bond percolation on hyperbolic lattices obtained by tiling a hyperbolic plane with constant negative Gaussian curvature. The quantity of our main concern is $p_{c2}$, the value of occupation probability where a unique…
We study the class of monotone, two-state, deterministic cellular automata, in which sites are activated (or 'infected') by certain configurations of nearby infected sites. These models have close connections to statistical physics, and…
We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…
We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage…
The percolated random geometric graph $G_n(\lambda, p)$ has vertex set given by a Poisson Point Process in the square $[0,\sqrt{n}]^2$, and every pair of vertices at distance at most 1 independently forms an edge with probability $p$. For a…
We consider independent anisotropic bond percolation on $\mathbb{Z}^d\times \mathbb{Z}^s$ where edges parallel to $\mathbb{Z}^d$ are open with probability $p<p_c(\mathbb{Z}^d)$ and edges parallel to $\mathbb{Z}^s$ are open with probability…
Percolation on a five-dimensional simple hypercubic (sc(5)) lattice with extended neighborhoods is investigated by means of extensive Monte Carlo simulations, using an effective single-cluster growth algorithm. The critical exponents,…
Bootstrap percolation models have been extensively studied during the two past decades. In this article, we study the following "anisotropic" bootstrap percolation model: the neighborhood of a point (m,n) is the set…
We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where…
The universality of the crossing probability $\pi_{hs}$ of a system to percolate only in the horizontal direction, was investigated numerically by using a cluster Monte-Carlo algorithm for the $q$-state Potts model for $q=2,3,4$ and for…
We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…
In this article, we study a bond percolation model on a horizontally stretched square lattice, constructed by stretching the distances between the columns of $\mathbb{Z}_+^2$ according to a collection of independent and identically…
Let $\{G_n\}_{n=1}^{\infty}$ be a sequence of transitive infinite connected graphs with $\sup\limits_{n\geq 1} p_c(G_n) < 1,$ where each $p_c(G_n)$ is bond percolation critical probability on $G_n.$ Schramm (2008) conjectured that if $G_n$…
We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…
In 2-neighborhood bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: infected vertices of G remain infected forever and in consecutive rounds healthy vertices with at least 2 already…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…
The $r$-edge bootstrap percolation on a graph is an activation process of the edges. The process starts with some initially activated edges and then, in each round, any inactive edge whose one of endpoints is incident to at least $r$ active…
The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold Pc=1/2. The calculated probabilities for free boundary…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…