Dear AATRN Networks members,
Our next online seminar will be tomorrow, Tuesday March 4th, at 5pm CET / 11am Eastern Time.
Speaker: Karel Devriendt
Title: Spanning trees, effective resistances and curvature on graphs
Abstract: Kirchhoff's celebrated matrix tree theorem expresses the number of spanning trees of a graph as the maximal minor of the Laplacian matrix of the graph. In modern language, this determinantal counting formula reflects the fact that spanning trees form a regular matroid. In this talk, I will give a short historical overview of the tree-counting problem and a related quantity from electrical circuit theory: the effective resistance. I will describe a characterization of effective resistances in terms of a certain polytope and discuss some recent applications to discrete notions of curvature on graphs. More details can be found in the preprint:
https://arxiv.org/abs/2410.07756
We will meet in the following coordinates:
Meeting ID: 656 2226 8279
Passcode: 557173
You may also be interested in adding AATRN’s Google calendar (
link), which contains other seminar information.
Best,
The AATRN Networks organisers
Daniela Egas Santander, Henri Riihimäki, Jason Smith