
- Sponsor
- Department of Mathematics
- Speaker
- Jaya Manthripragada
- Contact
- Rui Yu
- ruiyu6@illinois.edu
- Views
- 5
- Originating Calendar
- Mathematics Seminar Series: Probability
Title: Loop Measures III: Applications to Spanning Trees
Abstract: In the previous talk, we introduced loop-erased random walks and Wilson's algorithm, which provides a way to sample uniform spanning trees. In this talk, we will use these ideas to study the number of spanning trees of finite graphs. We will first recover Cayley's formula for complete graphs and then derive an exact formula for the number of spanning trees of the hypercube. Finally, we will discuss the asymptotic number of spanning trees of large subsets of the two-dimensional lattice and its connection to Catalan's constant.
Reference: Lawler, G. F., & Limic, V. (2010). Random Walk: A Modern Introduction, Sections 9.8–9.9. Cambridge University Press.