Circle Packing and Its Applications


July 31, 2015


Tom Hutchcroft


MS/University of British Columbia


The Koebe-Andreev-Thurston Circle Packing Theorem lets us draw planar graphs in a canonical way, so that the geometry of the drawing reveals analytic properties of the graph. In this talk, I will review the theory of circle packing and show several applications, old and new, to probability on planar graphs.


Tom Hutchcroft

Tom is a graduate student at UBC, Vancouver, where he is a student of Omer Angel and Asaf Nachmias. He is currently an intern at MSR. His research interests include stochastic processes on planar graphs and on random underlying structures.