Talk page
Title:
Random Walks on Dyadic Lattice Graphs and Their Duals
Speaker:
Abstract:
We will discuss recent work that has several surprising connections to our honoree, Chris Bishop. Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a singular stationary measure. This answers a question of Curien and shows behaviour different from the unimodular case. The consequence is that planar duality does not combine well with stationary random graphs. We also study harmonic measure on dyadic lattice graphs and show its singularity. Much interesting behaviour observed numerically remains to be explained. No background will be assumed for the talk. This is joint work with Graham White
Link:
Workshop: