Circle packings and random walks
Winter semester 2021/2022
This seminar focusses on the connection of circle packings and random walks, and a recently established connection between these two objects. Central part of the seminar are the interplay between geometric and probabilistic objects. We cover the theory of random walkson graphs and its connection with electric network theory; the circle packing theorem; parabolic and hyperbolic packings; planar local graph limits; uniform spanning trees of planar graphs.
Target group: Master students in Mathematics. Bachelor students with strong background in geometric group theory or discrete probability theory and keen interest in the topic may apply for admission.
- Asaf Nachmias: Planar Maps, Random Walks and Circle Packing
Lecture Notes in Mathematics 2243, Springer Open, 2020
- Kenneth Stephenson: Introduction to Circle Packing.
Cambridge University Press, 2005.
- Geoffrey Grimmett: Probability on Graphs.
Second edition, Cambridge University Press, 2018.
Time: Thursday 14-16 c.t. in room B045.Lecturers: Prof. Dr. Sebastian Hensel and Prof. Dr. Markus Heydenreich
Registration: Interested students please (pre-)register by email to Prof. Hensel.
Planned schedule (subject to change):
||Recap: Hyperbolic geometry
||Circle packings I
||Circle packings II
||Random walk and electrical network I
||Random walk and electrical network II
||Planar local graph limits
||Recurrence of random planar maps
||Uniform infinite planar triangulation/quadrangulation
||Uniform spanning trees and planar graphs I
||Uniform spanning trees and planar graphs II