Planar percolation and the loop O(n) model

Alexander Glazman, Matan Harel, Nathan Zelesko

We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require…