Webinar: XXIV Escola Brasileira de Probabilidade - Short Course I - Perla Sousi - Lecture 04

Speaker: Perla Sousi - (University of Cambridge)

Short Course I :
Title: Random walks and uniform spanning trees
Abstract: Spanning trees in a connected graph are basic objects of great interest in combinatorics and computer science. In this course we will study what a typical spanning tree looks like and we will discuss elegant sampling algorithms using random walks due to Aldous, Broder and Wilson from the 1990's. We will then explain how we can sample a uniform spanning tree (or forest) of $\mathbb{Z}^d$ for $d\geq 2$. Using the connection with random walks and a recent algorithm due to Hutchcroft we will obtain results on the fine geometry of uniform spanning trees.

SCIENTIFIC COMMITTEE
- Dirk Erhard (UFBA)
- Milton Jara (IMPA)
- Adriana Neumann (UFRGS)
- Christian Olivera (UNICAMP)

ORGANIZING COMMITTEE
- Dirk Erhard (UFBA)
- Milton Jara (IMPA)
- Diego Sebastian Ledesma (UNICAMP)
- Adriana Neumann (UFGRS)
- Christian Olivera (UNICAMP)

IMPA - Instituto de Matemática Pura e Aplicada ©
 
Os direitos sobre todo o material deste canal pertencem ao Instituto de Matemática Pura e Aplicada, sendo vedada a utilização total ou parcial do conteúdo sem autorização prévia e por escrito do referido titular, salvo nas hipóteses previstas na legislação vigente.

The rights over all the material in this channel belong to the Instituto de Matemática Pura e Aplicada, and it is forbidden to use all or part of it without prior written authorization from the above mentioned holder, except in the cases prescribed in the current legislation.