Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

Random walk on a graph is a beautiful and (viewed from today) classical subject with elegant theorems, multiple applications, and a close connection to the theory of electrical networks. The subject seems to be livelier now than ever, with lots of exciting new results. We will survey recent progress on the following questions: How long does it take to visit every edge of a graph, or to visit every vertex a representative number of times, or catch a random walker? Can random walks be coupled so that they don't collide? Mentioned will be work by or with Omer Angel, Olivier Bernardi, Jian Ding, Agelos Georgakopoulos, Ander Holroyd, Natasha Komarov, James Lee, James Martin, Yuval Peres, and David Wilson.