Colloquium de l'IDPRandom configurations driven by random walks
Wolfang Woess (Universität Graz, Autriche)
Thursday 04 May 2006 14:00 - Tours - Amphithéâtre 030 (Bât E1)
Consider an infinite graph and simple random walk on it (or more general random walks adapted to te graph structure). In the talk we discuss two Markov processes where such a random walk generates a sequence of random configurations (=finite subsets) on the graph. One is "Internal diffusion limited aggregation" where a source vertex emits particles that form a random cluster, and the other is "Lamplighter random walk", where a "lamplighter" performs a random walk on the graph and randomly switches on and off lamps that are located at the vertices of the graph.