Talk
Random processes on graphs
- Artem Sapozhnikov
Abstract
The goal of this course is to give an overview of some classical and recent developments in discrete probability. Possible topics include random walks and electric networks, cover and mixing times for Markov chains on finite graphs, self-avoiding walk, uniform spanning tree, percolation, random planar maps, etc.
Date and time info
Thursday 11.00 - 12.30
Language
Englsih
