Random walks on dynamical percolation
By Perla Sousi
Also appears in collection : 19th workshop on stochastic geometry, stereology and image analysis / 19ème conférence en géométrie stochastique, stéréologie et analyse d'images
We study the behaviour of random walk on dynamical percolation. In this model, the edges of a graph are either open or closed and refresh their status at rate $\mu$, while at the same time a random walker moves on $G$ at rate 1, but only along edges which are open. On the d-dimensional torus with side length $n$, when the bond parameter is subcritical, the mixing times for both the full system and the random walker were determined by Peres, Stauffer and Steif. I will talk about the supercritical case, which was left open, but can be analysed using evolving sets.
Joint work with Y. Peres and J. Steif.