Related papers: The box-crossing property for critical two-dimensi…
The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…
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 consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…
We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…
Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…
We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…
We consider (near-)critical percolation on the square lattice. Let M_n be the size of the largest open cluster contained in the box [-n,n]^2, and let pi(n) be the probability that there is an open path from O to the boundary of the box. It…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
We study the two-dimensional domain morphology of twisted nematic liquid crystals during their phase-ordering kinetics [R. A. L. Almeida, Phys. Rev. Lett. 131 (2023) 268101], which is a physical candidate to self-generate critical clusters…
We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…
We consider isoperimetric sets, i.e., sets with minimal vertex boundary for a prescribed volume, of the infinite cluster of supercritical site percolation on the triangular lattice. Let $p$ be the percolation parameter and let $p_c$ be the…
We discuss the following type of results about critical Bernoulli percolation in high dimensions: The collection of clusters that do contain large (self-avoiding) loops in a large box is tight. The collection of these large loops has…
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the…
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,…