Minhao Bai, Rutgers University

Abstract

Given a graph, a uniform spanning tree (UST) is defined as a random tree sampled uniformly from all of its spanning trees. How can we program that? Why is this useful? I will introduce Wilson's algorithm to sample UST and some other properties of UST if time permits.

See: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html