3 papers
math.PR2026
Supercritical sharpness of percolation
Sahar Diskin, Philip Easo, Ritvik Ramanan Radhakrishnan +2
We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least decays exponentiall…
math.PR2025
Counting minimal cutsets and
Philip Easo, Franco Severo, Vincent Tassion
We prove two results concerning percolation on general graphs. - We establish the converse of the classical Peierls argument: if the critical parameter for (uniform) percolation sa…
math.GR2025
Uniform finite presentation for groups of polynomial growth
Philip Easo, Tom Hutchcroft
We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let be a group with finite generating set and let $\operatornam…