|Location:||MSRI: Simons Auditorium|
This will be an informal talk which will not present any new results. I will start by presenting some of the results from Matt Baker\\'s talk on spanning trees and chip-firing games in a more probabilistic way. This part will be self-contained so it is not necessary to have gone to his talk.
Assuming sufficient time I will also show how one can deduce the matrix-tree theorem using Wilson\\'s algorithm and relate these to the random walk loop measure whose scaling limit is the Brownian loop measure. (A reference for this is Chapter 9 of my recent book with Vlada Limic.)