Prof. Ariel Yadin
In a random process, by definition, it is not possible to deterministically predict the next step. However, we will see in this course how to predict rigorously the long term behavior of processes. We will study in this course processes, known as Markov processes, in which the next step depends only on the current position. We will see that these processes are deeply related to electrical networks, and to notions from information theory such as entropy. We will develop techniques of discrete analysis, which are counterparts of classical analysis in the discrete setting. These notions are at the cutting edge of current research methods in these fields
Requirements and grading
This course deals with random walks, harmonic functions, the relations between these notions, and their applications to geometry and algebra (mainly to finitely generated groups).
The modern point of view will be presented, following recent texts by: Gromov, Kleiner, Ozawa, Shalom & Tao, among others.