Monday 14:00-16:00, SRZ 203
|Lecturer:||Prof. Dr. Chiranjib Mukherjee|
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
|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.)|