Français
Interlacements and the uniform spanning forest
Multi angle
Authors : Hutchcroft, Tom (Author of the conference)
CIRM (Publisher )
05C05 - Trees
20F65 - Geometric group theory
60D05 - Geometric probability and stochastic geometry
CIRM (Publisher )
Loading the player...
|
Abstract :
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$.
MSC Codes : 05C05 - Trees
20F65 - Geometric group theory
60D05 - Geometric probability and stochastic geometry
|
Information on the Video
Film maker : Hennenfent, GuillaumeLanguage : English Available date : 26/10/2017 Conference Date : 24/10/2017 Subseries : Research talks arXiv category : Probability ; Mathematical Physics ; Combinatorics Mathematical Area(s) : Combinatorics ; Probability & Statistics Format : MP4 (.mp4) - HD Video Time : 00:54:45 Targeted Audience : Researchers Download : https://videos.cirm-math.fr/2017-10-24_Hutchcroft.mp4 
|
Information on the Event
Event Title : Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoiresEvent Organizers : Ménard, Laurent ; Nolin, Pierre ; Schapira, Bruno ; Singh, Arvind Dates : 23/10/2017 - 27/10/2017 Event Year : 2017 Event URL : http://conferences.cirm-math.fr/1672.html
Citation Data
DOI : 10.24350/CIRM.V.19229403Cite this video as: Hutchcroft, Tom (2017). Interlacements and the uniform spanning forest. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19229403 URI : http://dx.doi.org/10.24350/CIRM.V.19229403 |
See Also
- [Multi angle] Frozen and near-critical percolation / Author of the conference van den Berg, Jacob.
- [Post-edited] Bootstrap percolation on Erdos-Renyi graphs / Author of the conference Angel, Omer.
- [Multi angle] Extinction time for the weaker of two competing stochastic SIS logistic epidemics / Author of the conference Luczak, Malwina.
- [Multi angle] Weighted distances in scale free random graphs / Author of the conference Komjathy, Julia.
Bibliography
- Hutchcroft, T. (2016). Interlacements and the Wired Uniform Spanning Forest.
