Interlacements and the uniform spanning forest
Apparaît également dans la collection : Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoires
The Aldous-Broder algorithm allows one to sample the uniform spanning tree of a finite graph as the set of first-entry edges of a simple random walk. In this talk, I will discuss how this can be extended to infinite transient graphs by replacing the random walk with the random interlacement process. I will then outline how this new sampling algorithm can be used to compute critical exponents for the uniform spanning forest of $Z^d$.
![$k$-sum free sets in $[0,1]$](/media/cache/video_light/uploads/video/2015-09-10_de_Roton-video--19cf70874d3c5af7378c268cab865b06.jpg)
