Bhargav Narayanan : Infinite mazes and exceptional graphs for the random walk

Posted by Dhruv Mubayi , part of the Departmental Colloquium.

At

March 8, 2019, 3 p.m.

In

636 SEO

Abstract

Is there a single sequence of directions that “solves” every maze? The question is trivial for finite mazes, but becomes far more interesting for infinite mazes. I will speak about various problems that arise from this seemingly innocuous question, focusing on connections to various “resilience properties” of the simple random walk.