AATRN Networks seminar, March 4th, at 5pm CET by Karel Devriendt.

6 views
Skip to first unread message

Jason Smith

unread,
Mar 3, 2025, 5:15:16 AMMar 3
to aatrn-n...@googlegroups.com, daniela.eg...@openbraininstitute.org, henri.r...@su.se, jason...@ntu.ac.uk
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

Our seminar occurs on the first Tuesday of every month, and you can follow our future planned list of speakers on our website sites.google.com/view/aatrn-networks-seminar.

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

Reply all
Reply to author
Forward
0 new messages