1201 E California Blvd

Pasadena, CA 91125

I am a Professor of Mathematics at the California Institute of Technology, which I joined in fall 2021. Before coming to Caltech, I was a Senior Research Associate and Herchel Smith Postdoctoral Research Fellow in the Department of Pure Mathematics and Mathematical Statistics at the University of Cambridge and a Junior Research Fellow in Trinity College. I obtained my PhD in 2017 from the University of British Columbia under the supervision of Asaf Nachmias and Omer Angel.

My research interests lie mostly in discrete probability, with some of my work touching on mathematical physics, group theory, ergodic theory, metric geometry and combinatorics.

I am an organizer of the Percolation Today webinar and an associate editor of Probability Theory and Related Fields and the Annales de l'Institut Henri Poincaré.

I am also an organizer of the Los Angeles Probability Forum, a new monthly event for the LA probability community beginning in 2022.

My ORCiD is 0000-0003-0061-593X. Click here for my CV.

Math 2 (analytic). Undergraduate course on ODEs from an analytic viewpoint. 28×1 hours.

Caltech, Fall 2022 and 2023. 📚 Notes

Caltech, Fall 2022 and 2023. 📚 Notes

Math 191c: Random walks and uniform spanning trees. Graduate topics course. 18×(3/2) hours.

Caltech, Spring 2022. 📚 Notes

Caltech, Spring 2022. 📚 Notes

Random walks and uniform spanning trees. Part III graduate course. 16×1 hours.

Cambridge, 2020. 📚 Notes 📝 Example Sheet 1 📝 Example Sheet 2 📝 Example Sheet 3

Cambridge, 2020. 📚 Notes 📝 Example Sheet 1 📝 Example Sheet 2 📝 Example Sheet 3

Uniform spanning forests in high dimension. Graduate mini-course. 3×1 hours.

Online Open Probability School, 2020. 🎬 Video 📚 Notes

Online Open Probability School, 2020. 🎬 Video 📚 Notes

Papers are listed in reverse chronological order by appearance on the arXiv.

Undergraduate coauthors are highlighted with a *.

See also publication lists on: The arXiv, MathSciNet, and Google Scholar.

🖥 Proof of the Diaconis-Freedman Conjecture on partially-exchangeable processes

👥 N. Halberstam and T. Hutchcroft

📖 Preprint

👥 N. Halberstam and T. Hutchcroft

📖 Preprint

🖥 Thick points of 4D critical branching Brownian motion

👥 N. Berestycki, T. Hutchcroft, and A. Jego

📖 Preprint

🎬 Percolation Today

👥 N. Berestycki, T. Hutchcroft, and A. Jego

📖 Preprint

🎬 Percolation Today

🖥 The critical percolation probability is local

👥 P. Easo and T. Hutchcroft

📖 Preprint

🗞 Quanta Magazine: A Close-Up View Reveals the ‘Melting’ Point of an Infinite Graph

🎬 Percolation Today

👥 P. Easo and T. Hutchcroft

📖 Preprint

🗞 Quanta Magazine: A Close-Up View Reveals the ‘Melting’ Point of an Infinite Graph

🎬 Percolation Today

🖥 Uniform finite presentation for groups of polynomial growth

👥 P. Easo and T. Hutchcroft

📖 Preprint

👥 P. Easo and T. Hutchcroft

📖 Preprint

🖥 Uniqueness of the infinite tree in low-dimensional random forests

👥 N. Halberstam and T. Hutchcroft

📖 Probability and Mathematical Physics, to appear.

🎬 Percolation Today

👥 N. Halberstam and T. Hutchcroft

📖 Probability and Mathematical Physics, to appear.

🎬 Percolation Today

🖥 Double-exponential susceptibility growth in Dyson's hierarchical model with |x-y|^{-2} interaction

👥 P. Easo, T. Hutchcroft, and J. Kurrek*

📖 Journal of Mathematical Physics, to appear

👥 P. Easo, T. Hutchcroft, and J. Kurrek*

📖 Journal of Mathematical Physics, to appear

🖥 The number of ends in the uniform spanning tree for recurrent unimodular random graphs

👥 D. van Engelenberg and T. Hutchcroft

📖 Annals of Probability, to appear

👥 D. van Engelenberg and T. Hutchcroft

📖 Annals of Probability, to appear

🖥 Critical cluster volumes in hierarchical percolation

👤 T. Hutchcroft

📖 Preprint

🎬 Percolation Today

👤 T. Hutchcroft

📖 Preprint

🎬 Percolation Today

🖥 Logarithmic corrections to the Alexander-Orbach conjecture for the four-dimensional uniform spanning tree

👥 N. Halberstam and T. Hutchcroft

📖 Preprint

👥 N. Halberstam and T. Hutchcroft

📖 Preprint

🖥 On the boundary at infinity for branching random walk

👥 E. Candellero and T. Hutchcroft

📖 Electronic Communications in Probability, to appear

👥 E. Candellero and T. Hutchcroft

📖 Electronic Communications in Probability, to appear

🖥 Most transient random walks have infinitely many cut times

👥 N. Halberstam and T. Hutchcroft

📖 Annals of Probability, 2023

👥 N. Halberstam and T. Hutchcroft

📖 Annals of Probability, 2023

🖥 Supercritical percolation on finite transitive graphs I: Uniqueness of the giant component

👥 P. Easo and T. Hutchcroft

📖 Duke Mathematical Journal, to appear

🎬 Stanford | Percolation Today

👥 P. Easo and T. Hutchcroft

📖 Duke Mathematical Journal, to appear

🎬 Stanford | Percolation Today

🖥 The bunkbed conjecture holds in the p ↑ 1 limit

👥 T. Hutchcroft, A. Kent*, and P. Nizić-Nikolac*

📖 Combinatorics, Probability, and Computing, 2022

👥 T. Hutchcroft, A. Kent*, and P. Nizić-Nikolac*

📖 Combinatorics, Probability, and Computing, 2022

🖥 High-dimensional near-critical percolation and the torus plateau

👥 T. Hutchcroft, E. Michta, and G. Slade

📖 Annals of Probability, 2023

🎬 Percolation Today

👥 T. Hutchcroft, E. Michta, and G. Slade

📖 Annals of Probability, 2023

🎬 Percolation Today

🖥 What are the limits of universality?

👥 N. Halberstam and T. Hutchcroft

📖 Proceedings of the Royal Society Series A, 2022

🎬 Percolation Today

👥 N. Halberstam and T. Hutchcroft

📖 Proceedings of the Royal Society Series A, 2022

🎬 Percolation Today

🖥 Non-triviality of the phase transition for percolation on finite transitive graphs

👥 T. Hutchcroft and M. Tointon

📖 Journal of the European Mathematical Society, to appear

🎬 Percolation Today

👥 T. Hutchcroft and M. Tointon

📖 Journal of the European Mathematical Society, to appear

🎬 Percolation Today

🖥 The critical two-point function for long-range percolation on the hierarchical lattice

👤 T. Hutchcroft

📖 Annals of Applied Probability, to appear

🎬 Percolation Today

👤 T. Hutchcroft

📖 Annals of Applied Probability, to appear

🎬 Percolation Today

🖥 Collisions of random walks in dynamic random environments

👥 N. Halberstam and T. Hutchcroft

📖 Electronic Journal of Probability, 2022

👥 N. Halberstam and T. Hutchcroft

📖 Electronic Journal of Probability, 2022

🖥 On the tail of the branching random walk local time

👥 O. Angel, T. Hutchcroft, and A. Járai

📖 Probability Theory and Related Fields, 2021

👥 O. Angel, T. Hutchcroft, and A. Járai

📖 Probability Theory and Related Fields, 2021

🖥 Percolation on hyperbolic graphs

👤 T. Hutchcroft

📖 Geometric and Functional Analysis, 2019

🎬 Courant Institute

👤 T. Hutchcroft

📖 Geometric and Functional Analysis, 2019

🎬 Courant Institute

🖥 Coalescing random walk on unimodular graphs

👥 E. Foxall, T. Hutchcroft, and M. Junge

📖 Electronic Communications in Probability, 2018

👥 E. Foxall, T. Hutchcroft, and M. Junge

📖 Electronic Communications in Probability, 2018

🖥 Mallows permutations as stable matchings

👥 O. Angel, A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Canadian Journal of Mathematics, 2020

👥 O. Angel, A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Canadian Journal of Mathematics, 2020

🖥 Statistical physics on a product of trees

👤 T. Hutchcroft

📖 Annales de l'Institut Henri Poincaré, 2019

👤 T. Hutchcroft

📖 Annales de l'Institut Henri Poincaré, 2019

🖥 Self-avoiding walk on nonunimodular transitive graphs

👤 T. Hutchcroft

📖 Annals of Probability, 2019

👤 T. Hutchcroft

📖 Annals of Probability, 2019

🖥 Finitely Dependent Cycle Coloring

👥 A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Electronic Communications in Probability, 2018

👥 A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Electronic Communications in Probability, 2018

🖥 Mallows Permutations and Finite Dependence

👥 A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Annals of Probability, 2020

👥 A.E. Holroyd, T. Hutchcroft, and A. Levy

📖 Annals of Probability, 2020

🖥 Hyperbolic and Parabolic Unimodular Random Maps

👥 O. Angel, T. Hutchcroft, A. Nachmias, and G. Ray

📖 Geometric and Functional Analysis, 2018

🎬 Isaac Newton Institute

👥 O. Angel, T. Hutchcroft, A. Nachmias, and G. Ray

📖 Geometric and Functional Analysis, 2018

🎬 Isaac Newton Institute

🖥 Uniform Spanning Forests of Planar Graphs

👥 T. Hutchcroft and A. Nachmias

📖 Forum of Mathematics Sigma, 2019

🎬 Isaac Newton Institute

👥 T. Hutchcroft and A. Nachmias

📖 Forum of Mathematics Sigma, 2019

🎬 Isaac Newton Institute

🖥 Interlacements and the Wired Uniform Spanning Forest

👤 T. Hutchcroft

📖 Annals of Probability, 2018

🎬 CIRM | OOPS Course

👤 T. Hutchcroft

📖 Annals of Probability, 2018

🎬 CIRM | OOPS Course

🖥 Boundaries of Planar Graphs: A Unified Approach

👥 T. Hutchcroft and Y. Peres

📖 Electronic Journal of Probability, 2017

👥 T. Hutchcroft and Y. Peres

📖 Electronic Journal of Probability, 2017

🖥 Indistinguishability of Trees in Uniform Spanning Forests

👥 T. Hutchcroft and A. Nachmias

📖 Probability Theory and Related Fields, 2017

🎬 Banff

👥 T. Hutchcroft and A. Nachmias

📖 Probability Theory and Related Fields, 2017

🎬 Banff

🖥 Unimodular Hyperbolic Triangulations: Circle Packing and Random Walk

👥 O. Angel, T. Hutchcroft, A. Nachmias, and G. Ray

📖 Inventiones Mathematicae, 2016

🎬 Banff

👥 O. Angel, T. Hutchcroft, A. Nachmias, and G. Ray

📖 Inventiones Mathematicae, 2016

🎬 Banff

🎓 Discrete Probability and the Geometry of Graphs. PhD Thesis. UBC, 2017