Kirchhoff’s matrix-tree theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for ...

A method for calculating local characteristics (i.e., finite-dimensional marginals) of T from the transfer-impedance matrix is presented. This differs from the classical matrix-tree theorem in that ...

Abstract Canada Research Chair in Mathematical Physics and Deputy Director of PIMS Abstract: This will be an exposition of identities that link Gaussian integration with combinatorial problems, in ...