skip to content

Counting with Gaussian integrals and cluster expansions

Presented by: 
D Brydges [UBC]
Tuesday 8th April 2008 - 10:00 to 11:00
INI Seminar Room 1

This is a review, beginning with examples of how to express various combinatorial problems, including self-avoiding walks and loops in graphs, in terms of Gaussian integrals. The second half will be a review of techniques such as tree graph formulas for approximating the resulting integrals.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons