Home /  New Extremes for Random Walk on a Graph


New Extremes for Random Walk on a Graph March 19, 2012 (04:10 PM PDT - 05:00 PM PDT)
Parent Program: --
Location: UC Berkeley, 60 Evans Hall
Speaker(s) Peter Winkler (Dartmouth College)
Description No Description
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
Secondary Mathematics Subject Classification
No Video Uploaded

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 discuss recent progress on some extremal problems. In particular,
how long can it take to visit every edge of a graph, or to visit every
vertex a representative number of times, or to catch a random walker? Can
random walks be scheduled or coupled so that they don't collide? Can moving
targets be harder to hit than fixed targets?

Mentioned will be work by or with Omer Angel, Jian Ding, Agelos Georgakopoulos, Ander Holroyd, Natasha Komarov, James Lee, James Martin, Yuval Peres, Perla Sousi, and David Wilson.

No Notes/Supplements Uploaded No Video Files Uploaded