Departmental Colloquium
Bhargav Narayanan
Rutgers
Infinite mazes and exceptional graphs for the random walk
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.
Friday March 8, 2019 at 3:00 PM in 636 SEO