Random processes on graphs

  • Lecturer: Artem Sapozhnikov
  • Date: Thursday 11.00 - 12.30
  • Room: MPI MiS A01
  • Language: English
  • Target audience: MSc students, PhD students, Postdocs

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.

01.03.2017, 13:57