Related papers: A Russo Seymour Welsh Theorem for critical site pe…

We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the…

We prove that the standard Russo-Seymour-Welsh theory is valid for Voronoi percolation. This implies that at criticality the crossing probabilities for rectangles are bounded by constants depending only on their aspect ratio. This result…

We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$…

We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane.…

In this note we consider site percolation on a two dimensional sandwich of thickness two, the graph Z^2 x {0,1}. We prove that there is no percolation at the critical point. The same arguments are valid for a sandwich of thickness three…

The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

We study infinite ``$+$'' or ``$-$'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph $G$ with finite vertex degree. If the critical percolation probability $p_c^{site}$ for the i.i.d.~Bernoulli…

We prove a general Russo-Seymour-Welsh result valid for any invariant planar percolation process satisfying positive association. This means that the probability of crossing a rectangle in the long direction is related by a homeomorphism to…

The minimal spanning forest on $\mathbb{Z}^{d}$ is known to consist of a single tree for $d \leq 2$ and is conjectured to consist of infinitely many trees for large $d$. In this paper, we prove that there is a single tree for quasi-planar…

For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling…

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…

We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and…

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…

Let $G$ be an infinite, connected, locally finite planar graph and consider i.i.d.\ Bernoulli$(p)$ site percolation. Write $p_c^{\mathrm{site}}(G)$ and $p_u^{\mathrm{site}}(G)$ for the critical and uniqueness thresholds. Using a…

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…

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…

We develop a fluctuation theory of connectivities for subcritical random cluster models. The theory is based on a comprehensive nonperturbative probabilistic description of long connected clusters in terms of essentially one-dimensional…

We study a percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…