Related papers: The scaling limit of critical hypercube percolatio…

We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…

We prove that near-critical percolation and dynamical percolation on the triangular lattice $\eta \mathbb{T}$ have a scaling limit as the mesh $\eta \to 0$, in the "quad-crossing" space $\mathcal{H}$ of percolation configurations introduced…

We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on…

We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…

The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on…

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 prove that the uniform infinite half-plane quadrangulation (UIHPQ), with either general or simple boundary, equipped with its graph distance, its natural area measure, and the curve which traces its boundary, converges in the scaling…

Numerical investigation of critical exponents on a hypercubic with L^d random sites with L up to $33 and d up to 7 show that above the critical dimension the phase transitions in Ising model and percolation are not alike.

We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…

We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…

Let $Q$ be a free Boltzmann quadrangulation with simple boundary decorated by a critical ($p=3/4$) face percolation configuration. We prove that the chordal percolation exploration path on $Q$ between two marked boundary edges converges in…

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infinite third moment. The scaling limit of the critical…

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

We study bond percolation on the hypercube $\{0,1\}^m$ in the slightly subcritical regime where $p = p_c (1-\varepsilon_m)$ and $\varepsilon_m = o(1)$ but $\varepsilon_m \gg 2^{-m/3}$ and study the clusters of largest volume and diameter.…

We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit…

We consider full scaling limits of planar nearcritical percolation in the Quad-Crossing-Topology introduced by Schramm and Smirnov. We show that two nearcritical scaling limits with different parameters are singular with respect to each…

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

We analyse the scaling limit of the sizes of the largest components of the Random Intersection Graph $G(n,m,p)$ close to the critical point $p=\frac{1}{\sqrt{nm}}$, when the numbers $n$ of individuals and $m$ of communities have different…

We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…