We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Random walks on dynamical percolation

Formal Metadata

Title
Random walks on dynamical percolation
Title of Series
Number of Parts
11
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate μ, 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, we determined (with A. Stauffer and J. Steif) the mixing times for both the full system and the random walker. The supercritical case is harder, but using evolving sets we were able (with J. Steif and P. Sousi) to analyze it for p sufficiently large. The critical and moderately supercritical cases remain open.
Keywords