Clay Mathematics Institute

Dedicated to increasing and disseminating mathematical knowledge

Self-avoiding walks on transitive graphs

Geoffrey Grimmett (University of Cambridge)

Abstract: What can be said about the connective constant of a transitive graph? We describe weak and strict inequalities, and make a conjecture. In addition, a locality theorem is presented: if two transitive graphs agree on a large neighbourhood, then their connective constants are nearly equal. Joint with Zhongyang Li.