Interlacements and the uniform spanning forest | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Interlacements and the uniform spanning forest

By Tom Hutchcroft

Appears in collections : Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoires, Exposés de recherche

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$.

Information about the video

Date of recording 24/10/2017
Date of publication 26/10/2017
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.19229403
Cite this video Hutchcroft, Tom (24/10/2017). Interlacements and the uniform spanning forest. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19229403
URL https://dx.doi.org/10.24350/CIRM.V.19229403

Domain(s)

Bibliography

Hutchcroft, T. (2016). Interlacements and the Wired Uniform Spanning Forest. <arXiv:1512.08509> - https://arxiv.org/abs/1512.08509

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2024

Give feedback