Related papers: Diagrammatic bounds on the lace-expansion coeffici…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
This article proposes a new way of deriving mean-field exponents for sufficiently spread-out Bernoulli percolation in dimensions $d>6$. We obtain an upper bound for the full-space and half-space two-point functions in the critical and…
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…
The large-scale behavior of two-dimensional critical percolation is expected to be described by a conformal field theory (CFT). Moreover, this putative CFT is believed to be of the logarithmic type, exhibiting logarithmic corrections to the…
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…
The two-dimensional site percolation problem is studied by transfer-matrix methods on finite-width strips with free boundary conditions. The relationship between correlation-length amplitudes and critical indices, predicted by conformal…
In this paper, we show that the oriented diameter of any $n$-vertex $2$-connected near triangulation is at most $\lceil{\frac{n}{2}}\rceil$ (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
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$.…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
We propose a method of studying the continuous percolation of aligned objects as a limit of a corresponding discrete model. We show that the convergence of a discrete model to its continuous limit is controlled by a power-law dependency…
We consider bond percolation on $\Z^d\times \Z^s$ where edges of $\Z^d$ are open with probability $p<p_c(\Z^d)$ and edges of $\Z^s$ are open with probability $q$, independently of all others. We obtain bounds for the critical curve in $(p,…
We consider long-range self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$ that are defined by power-law decaying pair potentials of the form $D(x)\asymp|x|^{-d-\alpha}$ with $\alpha>0$. The upper-critical dimension…
I report on the experimental confirmation that critical percolation statistics underlie the ordering kinetics of twisted nematic phases in the Allen-Cahn universality class. Soon after the ordering starts from a homogeneous disordered phase…
We study critical site percolation on the triangular lattice. We find the difference of the probabilities of having a percolation interface to the right and to the left of two given points in the scaling limit. This generalizes both Cardy's…
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the…
We consider oriented long-range percolation on a graph with vertex set $\mathbb{Z}^d \times \mathbb{Z}_+$ and directed edges of the form $\langle (x,t), (x+y,t+1)\rangle$, for $x,y$ in $\mathbb{Z}^d$ and $t \in \mathbb{Z}_+$. Any edge of…
Consider nearest-neighbor oriented percolation in $d+1$ space-time dimensions. Let $\rho,\eta,\nu$ be the critical exponents for the survival probability up to time $t$, the expected number of vertices at time $t$ connected from the…
We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…
The lace expansion is a powerful tool for analysing the critical behaviour of self-avoiding walks and percolation. It gives rise to a recursion relation which we abstract and study using an adaptation of the inductive method introduced by…