PIMS- UVic Discrete Math Seminar: Gourab Ray
Topic
Spanning trees and loop soups on surfaces
Speakers
Details
A spanning tree is a connected subgraph of a graph with no cycles. I will explain some well-known connection between such collection of trees and some Poissonian collection of loops, and a magical algorithm (known as Wilson's alorithm) to sample such trees very fast. Then I will try to explain a recent extension to the multiply connected setting, and pose an open question in the end.
Joint work with N. Berestycki and B. Laslier.
Additional Information
Time: 3.30PM - 4.30PM Pacific Time
Location: University of Victoria, MAC D116
Registration: Free
For more details on the seminar, please see the event page here.
Gourab Ray, University of Victoria