Related papers: Poisson percolation on the square lattice
We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…
We consider irreversible second-layer nucleation that occurs when two adatoms on a terrace meet. We solve the problem analytically in one dimension for zero and infinite step-edge barriers, and numerically for any value of the barriers in…
We study bond percolation of $N$ non-interacting Gaussian polymers of $\ell$ segments on a 2D square lattice of size $L$ with reflecting boundaries. Through simulations, we find the fraction of configurations displaying {\em no} connected…
In this article, we generalize known formulas for crossing probabilities. Prior crossing results date back to J. Cardy's prediction of a formula for the probability that a percolation cluster in two dimensions connects the left and right…
We divide the circular boundary of a hyperbolic lattice into four equal intervals, and study the probability of a percolation crossing between an opposite pair, as a function of the bond occupation probability p. We consider the {7,3}…
Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the…
The theoretical basis of continuum percolation has changed greatly since its beginning as little more than an analogy with lattice systems. Nevertheless, there is yet no comprehensive theory of this field. A basis for such a theory is…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
In this note, we investigate Bernoulli oriented bond percolation with parameter $p$ on $\mathbb{Z}^2$. In addition to the standard edges, which are open with probability $p$, we introduce diagonal edges each open with probability…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…
We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
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…
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…
Let $\mathcal{H}$ denote a collection of subsets of $\{1,2,\ldots,n\}$, and assign independent random variables uniformly distributed over $[0,1]$ to the $n$ elements. Declare an element $p$-present if its corresponding value is at most…
We introduce an extension of the frog model to Euclidean space and prove properties for the spread of active particles. Fix $r>0$ and place a particle at each point $x$ of a unit intensity Poisson point process $\mathcal P \subseteq \mathbb…
Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…
In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0),…