Probability Seminar: Geoffrey Grimmett
- Date: 11/21/2012
- Time: 15:00
Lecturer(s):
Geoffrey Grimmett, Cambridge
Location:
University of British Columbia
Topic:
Counting self-avoiding walks
Description:
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)
Other Information:
Location: ESB 2012