Major open problem in percolation theory potentially solved with ChatGPT

doubledamio1 pts0 comments

Philip Easo

Philip Easo

Open Menu<br>Close Menu

Philip Easo

Open Menu<br>Close Menu

I am a mathematician working at ETH Zurich.<br>I am a Junior Fellow of ETH’s Institute for Theoretical Studies and a Junior Research Fellow of Trinity College, Cambridge.<br>I completed my PhD in mathematics at Caltech in June 2025 under the supervision of Tom Hutchcroft.<br>My email address is pheaso@ethz.ch.

Research<br>Supercritical sharpness of percolation, with Diskin, Ramanan Radhakrishnan, Sudakov, and Tassion<br>Preprint<br>Counting minimal cutsets and pc, with Severo and Tassion<br>Forum of Mathematics, Pi<br>Sharpness and locality for percolation on finite transitive graphs<br>Geometric and Functional Analysis<br>The critical percolation probability is local, with Hutchcroft<br>Preprint (see also Quanta)<br>Uniform finite presentation for groups of polynomial growth, with Hutchcroft<br>Discrete Analysis<br>Double-exponential susceptibility growth in Dyson's hierarchical model with |x−y|^-2 interaction, with Hutchcroft and Kurrek<br>Journal of Mathematical Physics<br>Existence of a percolation threshold on finite transitive graphs<br>International Mathematics Research Notices<br>Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component, with Hutchcroft<br>Duke Mathematical Journal<br>The wired arboreal gas on regular trees<br>Electronic Communications in Probability<br>The Cuntz-Toeplitz algebras have nuclear dimension one, with Garijo et al.<br>Journal of Functional Analysis

Selected talks<br>Cutsets and percolation<br>The critical probability is local<br>Percolation on finite transitive graphs

percolation hutchcroft finite menu transitive graphs

Related Articles