Circle Packing and Its Applications
- 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.
Speaker Details
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.
-
-
Jeff Running
-
Series: Microsoft Research Talks
-
Decoding the Human Brain – A Neurosurgeon’s Experience
- Dr. Pascal O. Zinn
-
-
-
-
-
-
Challenges in Evolving a Successful Database Product (SQL Server) to a Cloud Service (SQL Azure)
- Hanuma Kodavalla,
- Phil Bernstein
-
Improving text prediction accuracy using neurophysiology
- Sophia Mehdizadeh
-
Tongue-Gesture Recognition in Head-Mounted Displays
- Tan Gemicioglu
-
DIABLo: a Deep Individual-Agnostic Binaural Localizer
- Shoken Kaneko
-
-
-
-
Audio-based Toxic Language Detection
- Midia Yousefi
-
-
From SqueezeNet to SqueezeBERT: Developing Efficient Deep Neural Networks
- Forrest Iandola,
- Sujeeth Bharadwaj
-
Hope Speech and Help Speech: Surfacing Positivity Amidst Hate
- Ashique Khudabukhsh
-
-
-
Towards Mainstream Brain-Computer Interfaces (BCIs)
- Brendan Allison
-
-
-
-
Learning Structured Models for Safe Robot Control
- Subramanian Ramamoorthy
-
