Related papers: Supercritical sharpness for Voronoi percolation

We consider percolation on $\mathbb{Z}^d$ and on the $d$-dimensional discrete torus, in dimensions $d \ge 11$ for the nearest-neighbour model and in dimensions $d>6$ for spread-out models. For $\mathbb{Z}^d$, we employ a wide range of…

The aim of this paper is to explore possible ways of extending Smirnov's proof of Cardy's formula for critical site-percolation on the triangular lattice to other cases (such as bond-percolation on the square lattice); the main question we…

Consider critical Bernoulli percolation on $\mathbb{Z}^d$ for $d$ large; let $y_0, \dots, y_{k-1}$ be $k$ distinct points in $\mathbb{R}^d$. We prove that the probability that $\{\lfloor n y_i\rfloor\}_{i=0}^{k-1}$ all lie in the same open…

We prove that the connectivity of the level sets of a wide class of smooth centred planar Gaussian fields exhibits a phase transition at the zero level that is analogous to the phase transition in Bernoulli percolation. In addition to…

In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…

We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find…

A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…

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 develop an Ornstein--Zernike theory for the two-dimensional random-cluster model with $1 \leq q <4$ that also applies in its near-critical regime. In particular, we prove an asymptotic formula for the two-point function which holds…

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…

Recently, the number of non-standard percolation models has proliferated. In all these models, there exists a phase transition at which long range connectivity is established, if local connectedness increases through a threshold $p_c$. In…

Conduction in bulk polycrystalline high-T$_c$ superconductors with relatively high critical currents has been shown to be percolative. This phenomenon is due to weak links at grain boundaries. These weak links are the major limiting factor…

We reinvestigate the 2D problem of the inhomogeneous incipient infinite cluster where, in an independent percolation model, the density decays to p_c with an inverse power, \lambda, of the distance to the origin. Assuming the existence of…

This Letter studies the critical point as well as the discontinuity of a class of explosive site percolation in Erd\"{o}s and R\'{e}nyi (ER) random network. The class of the percolation is implemented by introducing a best-of-m rule. Two…

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Using the randomized algorithm method developed by Duminil-Copin, Raoufi and Tassion (2019b), we exhibit sharp phase transition for the confetti percolation model. This provides an alternate proof, than that of Ahlberg, Tassion and Texeira…

In this paper, we introduce and study the annealed spectral sample of Voronoi percolation, which is a continuous and finite point process in $\mathbb{R}^2$ whose definition is mostly inspired by the spectral sample of Bernoulli percolation…

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…