New Proof Extends Phase-Transition Sharpness to All Infinite Graphs

A five-person ETH Zurich team proved supercritical sharpness for percolation on all infinite transitive graphs, showing that any probability just above the critical threshold yields almost full connectivity and solving a decades-long puzzle in probability and graph theory, using a refined sprinkling approach that unifies the result across graph types.