Related papers: Hyperbolic site percolation
We study bond percolation on the Hamming hypercube {0,1}^m around the critical probability p_c. It is known that if p=p_c(1+O(2^{-m/3})), then with high probability the largest connected component C_1 is of size Theta(2^{2m/3}) and that…
We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$…
How many $n$-step polygons exist that contain a given vertex of an infinite quasi-transitive graph $G$? The exponential growth rate of such polygons is identified as the connective constant when $G$ has sub-exponential growth and possesses…
The bunkbed of a graph $G$ is the graph $G\times\left\{ 0,1\right\} $. It has been conjectured that in the independent bond percolation model, the probability for $\left(u,0\right)$ to be connected with $\left(v,0\right)$ is greater than…
We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
The intrinsic geometry of the critical percolation cluster induced by the level set of the metric Gaussian free field on $\mathbb{Z}^{d}$ has been the subject of much recent activity. (Lupu, 2016) established that the critical percolation…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…
The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…
The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…
The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We revisit this conjecture and study it in the broader context of…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
Using conformal field theory, we derive several new crossing formulas at the two-dimensional percolation point. High-precision simulation confirms these results. Integrating them gives a unified derivation of Cardy's formula for the…
Let ${\mathbb{L}}$ be the $d$-dimensional hypercubic lattice and let ${\mathbb{L}}_0$ be an $s$-dimensional sublattice, with $2 \leq s < d$. We consider a model of inhomogeneous bond percolation on ${\mathbb{L}}$ at densities $p$ and…
We present a study of connectivity percolation in suspensions of hard spherocylinders by means of Monte Carlo simulation and connectedness percolation theory. We focus attention on polydispersity in the length, the diameter and the…
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…
One of the most well-known classical results for site percolation on the square lattice is the equation $p_c+p_c^*=1$. In words, this equation means that for all values $\neq p_c$ of the parameter $p$, the following holds: either a.s. there…