Related papers: Bootstrap percolation on rhombus tilings

We study the probability that a loop is null-homotopic -- that is, bounded by the continuous image of a disk -- in plaquette percolation on $\mathbb{Z}^3.$ Locally, the event that there is a ``horizontal disk crossing'' of a rectangular…

Let $G=(V,E)$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. In recent work, we conjectured that if $G$ is nonamenable then the matrix of critical connection probabilities…

Based on extensive simulations, we conjecture that critically pinned interfaces in 2-dimensional isotropic random media with short range correlations are always in the universality class of ordinary percolation. Thus, in contrast to…

We study the distribution of the percolation time $T$ of two-neighbour bootstrap percolation on $[n]^2$ with initial set $A\sim\mathrm{Bin}([n]^2,p)$. We determine $T$ with high probability up to a constant factor for all $p$ above the…

We prove that there exist natural generalizations of the classical bootstrap percolation model on $\mathbb{Z}^2$ that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this…

A graph $G$ percolates in the $K_{r,s}$-bootstrap process if we can add all missing edges of $G$ in some order such that each edge creates a new copy of $K_{r,s}$, where $K_{r,s}$ is the complete bipartite graph. We study…

In this paper a random graph model $G_{\mathbb{Z}^2_N,p_d}$ is introduced, which is a combination of fixed torus grid edges in $(\mathbb{Z}/N \mathbb{Z})^2$ and some additional random ones. The random edges are called long, and the…

We formulate and analyze a novel hypothesis testing problem for inferring the edge structure of an infection graph. In our model, a disease spreads over a network via contagion or random infection, where the random variables governing the…

In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…

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…

The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…

We study bootstrap percolation (BP) on hyperbolic lattices obtained by regular tilings of the hyperbolic plane. Our work is motivated by the connection between the BP transition and the dynamical transition of kinetically constrained…

Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a…

We investigate the formation of an infinite cluster of entangled threads in a (2+1)-dimensional system. We demonstrate that topological percolation belongs to the universality class of the standard 2D bond percolation. We compute the…

We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by investigating geometric percolation of non-interacting line segments and disks in two spatial dimensions. These examples serve as models for…

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 investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…