Probability Theory on Trees and Groups

SS 2022

General Information


Monday 14:00-16:00, SRZ 203
Wednesday 14:00-16:00, SRZ 205

Lecturer: Prof. Dr. Chiranjib Mukherjee
Assistance: Konstantin Recke


Course syllabus:

The course is concerned with behavior of random walks on certain infinite graphs which are currently in vigorous development. This is a topic of discrete probability and full of surprising and beautiful results which lie at the crossroads of probability theory, other areas of mathematics (e.g. geometry) and theoretical  computer science.  There are three major types of graphs which we will be studying: trees, Cayley graphs of groups and planar graphs. 

Our major topics include random walks and their intimate connection to electrical networks; uniform spanning trees, their limiting forests, and their marvelous relationships with random walks and electrical networks; branching processes; percolation and the powerful, elegant
mass-transport technique; isoperimetric inequalities and how they relate to both random walks and percolation. Connections among these topics are pervasive and rich, making for surprising and enjoyable proofs.

Literature: See Learnweb.
Learnweb: Please enroll in the Learnweb course for this lecture.
Course assessment: Successful completion of 40% of the homework sets as well as an oral/written exam at the end of the course (format, date and time t.b.a.)
Tutorials: t.b.a.