Image from OpenLibrary

Random walks and uniform spanning trees.

By: Contributor(s): Publication details: Rio de Janeiro: IMPA, 2020.Description: video onlineSubject(s): DDC classification:
  • cs
Online resources:
Contents:
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 .
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Mini course (Webinar) - 5 lectures.

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 .

There are no comments on this title.

to post a comment.
© 2023 IMPA Library | Customized & Maintained by Sérgio Pilotto


Powered by Koha