PIMS Postdoctorial Colloquium: Ori Gurel-Gurevich
Topic
Random Walks and Electric Networks
Speakers
Details
Abstract:
We will explore the relation between random walks on graphs and the properties of the graph as an electric network. We will use these to prove some classic theorems of Polya (about recurrence and transience of lattices), and some less classic theorems of mine (about recurrence of the trace of a simple random walk).
No prior knowledge beyond undergraduate math will be assumed.
