Counting self-avoiding walks

04/01/2014 - 12:15pm
04/01/2014 - 1:10pm
Geoffrey Grimmett (Downing College, University of Cambridge)

The connective constant of a transitive graph is the asymptotic growth rate of the number of self-avoiding walks. How small/large can be the connective constant of a regular graph? We give sharp inequalities for transitive graphs, and we explain how to prove strict inequalities as the graph varies, with applications to Cayley graphs. (joint work with Zhongyang Li) 


Mudd Science Library 126 (Pomona College)

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences