Self-avoiding Walk and Connective Constant

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

• Li, Z (University of Connecticut)
• Tuesday 21 April 2015, 14:00-15:00
• Seminar Room 1, Newton Institute.

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

Random Geometry

Co-author: Geoffrey Grimmett (University of Cambridge)

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. I will also present a locality result regarding to the connective constants proved by defining a linearly increasing harmonic function on Cayley graphs. In particular, the connective constant is local for all solvable groups. Joint work with Geoffrey Grimmett.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• Isaac Newton Institute Seminar Series
• Seminar Room 1, Newton Institute

Note that ex-directory lists are not shown.