Bernhard Krön School of Mathematics and Statistic, University of Sydney Random walks on self-similar graphs Wednesday 4th, August 14:05-14:55pm, Carslaw Lecture Theatre 273. Self-similar graphs are discrete versions of self-similar fractals. We discuss a class of self-similar graphs which contains most of the well known examples. The simple random walk on these graphs is understood very well, because the generating functions of the $n$-step transition probabilies can be computed explicitely.