Related papers: Local Bootstrap Percolation
We prove several facts concerning Lipschitz percolation, including the following. The critical probability p_L for the existence of an open Lipschitz surface in site percolation on Z^d with d\ge 2 satisfies the improved bound p_L \le…
The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds $p_c$ for…
The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…
We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min(1,\beta\|x-y\|)^{-d\alpha}$ for…
Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…
The BTW sandpile model is considered on three dimensional percolation lattice which is tunned with the occupation parameter $p$. Along with the three-dimensional avalanches, we study the energy propagation in two-dimensional cross-sections.…
We prove the existence of a (random) Lipschitz function $F : \Z^{d-1}\to\Z^+$ such that, for every $x \in \Z^{d-1}$, the site $(x,F(x))$ is open in a site percolation process on $\Z^{d}$. The Lipschitz constant may be taken to be 1 when 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…
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the infinite cluster,…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…
We extend a previously proposed deposition model with two kinds of particles, considering the restricted solid-on-solid condition. The probability of incidence of particle C (A) is p (1-p). Aggregation is possible if the top of the column…
Consider an independent site percolation model with parameter $p \in (0,1)$ on $\Z^d,\ d\geq 2$ where there are only nearest neighbor bonds and long range bonds of length $k$ parallel to each coordinate axis. We show that the percolation…
The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from…
We investigate the process of invasion percolation between two sites (injection and extraction sites) separated by a distance r in two-dimensional lattices of size L. Our results for the non-trapping invasion percolation model indicate that…
We develop a recursive formula for the probability of a k-cluster in bootstrap percolation.
For $r\geq1$, the $r$-neighbour bootstrap process in a graph $G$ starts with a set of infected vertices and, in each time step, every vertex with at least $r$ infected neighbours becomes infected. The initial infection percolates if every…
In this work we investigate a bootstrap percolation process on random graphs generated by a random graph model which combines preferential attachment and edge insertion between previously existing vertices. The probabilities of adding…
We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…
We investigate coherent transport over a finite square lattice in which the growth of bond percolation clusters are subjected to an Achlioptas type selection process, i.e., whether a bond will be placed or not depends on the sizes of…