Related papers: Critical exponents of planar gradient percolation
We consider a critical Bernoulli site percolation on the uniform infinite planar triangulation. We study the tail distributions of the peeling time, perimeter, and volume of the hull of a critical cluster. The exponents obtained here…
We show the existence of a scaling limit for the crossing probabilities on the square lattice in an equilateral triangle for the critical percolation. We also show that Cardy's formula does not hold on the square lattice for the critical…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
We investigate oriented bond-site percolation on the planar lattice in which entire columns are stretched. Generalising recent results by Hil\'ario et al., we establish non-trivial percolation under a $(1+\varepsilon)$-th moment condition…
Percolation refers to an interesting class of problems related to the properties of disordered systems, usually formulated in terms of objects randomly placed on an underlying lattice or continuum. Despite the simplicity of the setup, most…
It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…
We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…
We study the site version of (independent) first-passage percolation on the triangular lattice $\mathbb{T}$. Denote the passage time of the site $v$ in $\mathbb{T}$ by $t(v)$, and assume that $P(t(v)=0)=P(t(v)=1)=1/2$. Denote by $a_{0,n}$…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…
Building on the identification of the scaling limit of the critical percolation exploration process as a Schramm-Loewner Evolution, we derive a PDE characterization for the crossing probability of an annulus.
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…
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…
Consider the indicator function $f$ of a two-dimensional percolation crossing event. In this paper, the Fourier transform of $f$ is studied and sharp bounds are obtained for its lower tail in several situations. Various applications of…
We consider critical percolation on the triangular lattice in a bounded simply connected domain with boundary conditions that force an interface between two prescribed boundary points. We say the interface forms a "near-loop" when it comes…
A new site percolation model, directed spiral percolation (DSP), under both directional and rotational (spiral) constraints is studied numerically on the square lattice. The critical percolation threshold $p_c\approx 0.655$ is found between…
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 determine thresholds $p_c$ for random-site percolation on a triangular lattice for all available neighborhoods containing sites from the first to the fifth coordination zones, including their complex combinations. There are 31 distinct…
The localization transition and the critical properties of the Lorentz model in three dimensions are investigated by computer simulations. We give a coherent and quantitative explanation of the dynamics in terms of continuum percolation…