Probability Seminar: Geoffrey Grimmett
Topic
Counting self-avoiding walks
Speakers
Details
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. (joint work with Zhongyang Li)
Additional Information
Location: ESB 2012
Geoffrey Grimmett, Cambridge
Geoffrey Grimmett, Cambridge