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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Self-avoiding walk on regular graphs

Download to your calendar using vCal

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Old Kitchens, Queen's College Engineering Department - ***LR3B*** DAMPT MR2

Other talks

Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? BSU Seminar: "Response Adaptivity Across Clinical Trials In Portfolios of Biomedical Innovations" Title to be confirmed Fairy Tales Morning Break Reversals of the Geodynamo
 

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