11/02/2026, 16:00 — 17:00 — Online
Matan Harel, Northeastern University
Planar percolation and the loop O(n) model
Consider a tail trivial, positively associated site percolation process such that the set of open vertices is stochastically dominated by the set of closed ones. We show that, for any planar graph G, such a process must contain zero or infinitely many infinite connected components. The assumptions cover Bernoulli site percolation at parameter p less than or equal to one half, resolving a conjecture of Benjamini and Schramm. As a corollary, we prove that p_c is greater than or equal to 1/2 for any unimodular, invariantly amenable planar graphs. We will then apply this percolation statement to the loop O(n) model on the hexagonal lattice, and show that, whenever n is between 1 and 2 and x is between 1/sqrt(2) and 1, the model exhibits infinitely many loops surrounding every face of the lattice, giving strong evidence for conformally invariant behavior in the scaling limit (as conjectured by Nienhuis).
