Counting with Gaussian integrals and cluster expansions
Seminar Room 1, Newton Institute
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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.