COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## A random walk proof of Kirchhoff's matrix tree theoremAdd to your list(s) Download to your calendar using vCal - Kozdron, M (University of Regina)
- Wednesday 17 June 2015, 11:30-12:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact webseminars. 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:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note that ex-directory lists are not shown. |
## Other listsCambridge City Seminar at CRASSH Artificial Intelligence: Disrupting Sustainability Conference Wolfson Informal Lunchtime Seminar Series## Other talksNew micro-machines, new materials John Stuart Mill on Universal History Findings from studies of Virtual Reality sketching Using Sidekick to Define the Role of Apical Vertices in Morphogenesis Social Representations of Women who Live as Men in Northern Albania Transcription factors as drivers and drug targets in cancer |