The random walk on a graph is a widely known process in natural science. But what happens if every edge of the graph is equipped with a random variable deciding if it is open or closed? Meaning the graph itself becomes random. How does this process behave on large timescales? In this talk I will give an overview of the matter and state some interesting results.