University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > A random walk proof of Kirchhoff's matrix tree theorem

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

A random walk proof of Kirchhoff's matrix tree theorem

Download to your calendar using vCal

If you have a question about this talk, please contact .

Random Geometry

Kirchhoff’s matrix tree theorem relates the number of spanning trees in a graph to the determinant of a matrix derived from the graph. There are a number of proofs of Kirchhoff’s theorem known, most of which are combinatorial in nature. In this talk we will present a relatively elementary random walk-based proof of Kirchhoff’s theorem due to Greg Lawler which follows from his proof of Wilson’s algorithm. Moreover, these same ideas can be applied to other computations related to general Markov chains and processes on a finite state space. Based in part on joint work with Larissa Richards (Toronto) and Dan Stroock (MIT).

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://zoom.us/webinar/register/WN_oWsowrrnQ5-LiMi6OtktrQ FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon McGrath Centre, St Catharine’s College, University of Cambridge

Other talks

When is a mummy not a mummy? Andean bodies and the problem of scientific classification in Britain Welfare Reform and the Imperative of Cooperation Nationalising Oil and Knowledge in Iran: Labour, Decolonisation and Colonial Modernity, 1933–51 Cambridge AI in Medicine Seminar - July 2026 Morning Break Title TBC
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity