• Start Date: April 17, 2024
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Minhao Bai - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Event Additional Info: <p>See:&nbsp;<a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
  • Presentation Type: Stand Alone Presentation
  • 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.