Related papers: A simple proof of exponential decay in the two dim…
We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…
In random percolation one finds that the mean field regime above the upper critical dimension can simply be explained through the coexistence of infinite percolating clusters at the critical point. Because of the mapping between percolation…
Percolation theory is applied to the phase-transition dynamics of domain pattern formation in segregating binary Bose--Einstein condensates in quasi-two-dimensional systems. Our finite-size-scaling analysis shows that the percolation…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…
We prove several facts concerning Lipschitz percolation, including the following. The critical probability p_L for the existence of an open Lipschitz surface in site percolation on Z^d with d\ge 2 satisfies the improved bound p_L \le…
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…
The major difference between percolation and other phase transition models is the absence of an Hamiltonian and of a partition function. For this reason it is not straightforward to identify the corresponding field theory to be used as…
Jamming and percolation of square objects of size $k \times k$ ($k^2$-mers) isotropically deposited on simple cubic lattices have been studied by numerical simulations complemented with finite-size scaling theory. The $k^2$-mers were…
The truncated two-point function of the ferromagnetic Ising model on $\mathbb Z^d$ ($d\ge3$) in its pure phases is proven to decay exponentially fast throughout the ordered regime ($\beta>\beta_c$ and $h=0$). Together with the previously…
We study percolation on the hierarchical lattice of order $N$ where the probability of connection between two points separated by distance $k$ is of the form $c_k/N^{k(1+\delta)},\; \delta >-1$. Since the distance is an ultrametric, there…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…
We have derived long series expansions of the percolation probability for site and bond percolation on directed square and honeycomb lattices. For the square bond problem we have extended the series from 41 terms to 54, for the square site…
The stacked triangular lattice has the shape of a triangular prism. In spite of being considered frequently in solid state physics and materials science, its percolation properties have received few attention. We investigate several…
We study proper lattice animals for bond- and site-percolation on the hypercubic lattice $\mathbb{Z}^d$ to derive asymptotic series of the percolation threshold $p_c$ in $1/d$, The first few terms of these series were computed in the 1970s,…
We show that a site percolation is a stronger model than a bond percolation. We use the van den Berg -- Kesten (vdBK) inequality to prove that site percolation on a neighborhood of a vertex of degree $4$ cannot be simulated even…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…
We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…
We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…