Student Probability Seminar

---

Spanning trees of random graphs

Speaker: Guillaume Dubach

Location: Warren Weaver Hall 805

Date: Thursday, May 10, 2018, 11 a.m.

Synopsis:

For this last talk of the year, we will recall and prove the famous, simple and powerful result known as the matrix-tree theorem, and deduce from it some facts about spanning trees of Erdös-Renyi graphs as well as cycles of random permutations.

Notes:

No previous knowledge of anything beside linear algebra will be assumed.