Related papers: Arm events in two-dimensional invasion percolation
Consider a long-range percolation model on $\mathbb{Z}^d$ where the probability that an edge $\{x,y\} \in \mathbb{Z}^d \times \mathbb{Z}^d$ is open is proportional to $\|x-y\|_2^{-d-\alpha}$ for some $\alpha >0$ and where $d > 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…
Percolation is one of the simplest and nicest models in probability theory/statistical mechanics which exhibits critical phenomena. Dynamical percolation is a model where a simple time dynamics is added to the (ordinary) percolation model.…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
We calculate the one-arm probability and the two-point function for loop percolation in dimensions five and higher on the lattice up to first order. This answers a question posed by Y. Chang and A. Sapozhnikov in Probability Theory and…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
We study the effects of mobility on two crucial characteristics in multi-scale dynamic networks: percolation and connection times. Our analysis provides insights into the question, to what extent long-time averages are well-approximated by…
We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the…
In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
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…
We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…
In this work we consider random two-colourings of random linear preferential attachment trees, which includes random recursive trees, random plane-oriented recursive trees, random binary search trees, and a class of random $d$-ary trees.…
We study the probability that the origin is connected to the boundary of the box of size $n$ (the one-arm probability) in several percolation models related to the Ising model. We prove that different universality classes emerge at…
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…
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…
2D Percolation path exponents $x^{\cal P}_{\ell}$ describe probabilities for traversals of annuli by $\ell$ non-overlapping paths, each on either occupied or vacant clusters, with at least one of each type. We relate the probabilities…