DiscoverRandom GeometryA random walk proof of Kirchhoff's matrix tree theorem
A random walk proof of Kirchhoff's matrix tree theorem

A random walk proof of Kirchhoff's matrix tree theorem

Update: 2015-06-29
Share

Description

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).
Comments 
loading
00:00
00:00
1.0x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

A random walk proof of Kirchhoff's matrix tree theorem

A random walk proof of Kirchhoff's matrix tree theorem

Cambridge University