Related papers: On monochromatic arm exponents for 2D critical per…
In a disordered system one can either consider a microcanonical ensemble, where there is a precise constraint on the random variables, or a canonical ensemble where the variables are chosen according to a distribution without constraints.…
Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} containing a monochromatic k-term arithmetic progression…
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 study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…
Percolation, a paradigmatic geometric system in various branches of physical sciences, is known to possess logarithmic factors in its correlators. Starting from its definition, as the $Q\rightarrow1$ limit of the $Q$-state Potts model with…
We study an asymptotic expansion of the critical point for the nearest-neighbor oriented percolation on $\mathbb Z^d$ in powers of $d^{-1}$ as $d\rightarrow \infty$. The proof relies heavily on the lace expansion.
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability $C/ r^{1+\sigma}$, where $r$ is the distance length between distinct sites. We introduce and test an order $N$ Monte Carlo algorithm and we…
We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we…
We study invasion percolation in two dimensions, focusing on properties of the outlets of the invasion and their relation to critical percolation and to incipient infinite clusters (IIC's). First we compute the exact decay rate of the…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
Fractal geometry of critical curves appearing in 2D critical systems is characterized by their harmonic measure. For systems described by conformal field theories with central charge $c\leqslant 1$, scaling exponents of harmonic measure…
We derive an exact expression for the celebrated backbone exponent for Bernoulli percolation in dimension two at criticality. It turns out to be a root of an elementary function. Contrary to previously known arm exponents for this model,…
In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension of the classical framework of Toom. This…
We examine the effects of introducing a wall or edge into a directed percolation process. Scaling ansatzes are presented for the density and survival probability of a cluster in these geometries, and we make the connection to surface…
We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metric). Kesten (1986) famously showed that this is true for the…
A conjecture of Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer and Straus states that, with the exception of equilateral triangles, any two-coloring of the plane will have a monochromatic congruent copy of every three-point…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, $n$. Meanders are considered distinct up to any smooth deformation leaving the line fixed.…
We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection.…
In this work we consider arc criticality in colourings of oriented graphs. We study deeply critical oriented graphs, those graphs for which the removal of any arc results in a decrease of the oriented chromatic number by $2$. We prove the…