Related papers: Percolation probability and critical exponents for…
The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…
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…
Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large…
We conjecture an exact form for an universal ratio of four-point cluster connectivities in the critical two-dimensional $Q$-color Potts model. We also provide analogous results for the limit $Q\rightarrow 1$ that corresponds to percolation…
We study a dependent site percolation model on the $n$-dimensional Euclidean lattice where, instead of single sites, entire hyperplanes are removed independently at random. We extend the results about Bernoulli line percolation showing that…
We consider the Gaussian free field $\varphi$ on $\mathbb{Z}^d$, for $d\geq3$, and give sharp bounds on the probability that the radius of a finite cluster in the excursion set $\{\varphi \geq h\}$ exceeds a large value $N$, for any height…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical…
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…
In Bernoulli bond percolation on the Cartesian product graph of a $d$-regular tree and a line, we give an upper bound for the critical probability $p_c$.
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $\omega_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We study Bernoulli first-passage percolation (FPP) on the triangular lattice $\mathbb{T}$ in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. Denote by $\mathcal {C}_{\infty}$ the infinite cluster with…
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher…
In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
The $q=2$ random cluster model is studied in the context of two mean field models: The Bethe lattice and the complete graph. For these systems, the critical exponents that are defined in terms of finite clusters have some anomalous values…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
This paper is a study of some of the critical properties of a simple model for flux. The model is motivated by gauge theory and is equivalent to the Ising model in three dimensions. The phase with condensed flux is studied. This is the…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…