University of Cambridge > Talks.cam > Probability > Self-avoiding walk on regular graphs

Self-avoiding walk on regular graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact neb25.

A self-avoiding walk (SAW) is a path on a graph that revisits no vertex. The connective constant of a graph is defined to be the exponential growth rate of the number of n-step SAWs with respect to n. We prove that sqrt{d-1} is a universal lower bound for connective constants of any infinite, connected, transitive, simple, d-regular graph. We also prove that the connective constant of a Cayley graph decreases strictly when a new relator is added to the group and increases strictly when a non-trivial word is declared to be a generator. Joint work with Geoffrey Grimmett.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity