ABSTRACT:
How small/large can be the connective constant of a regular graph?
We describe sharp inequalities for transitive graphs, and we explain
how to obtain a strict inequality as the graph varies.
(Joint work with Zhongyang Li)
BIO:
Geoffrey Grimmett is a probabilist from Cambridge. He is mainly
interested in problems involving sequences of coin flips, and
especially disordered systems such as percolation and interacting
physical systems. He is the author of a celebrated book on
Percolation theory and was Head of the
Department of Pure Mathematics and Mathematical Statistics, Cambridge Univ.
from 2002 to 2007. For more details see
http://en.wikipedia.org/wiki/G._R._Grimmett or
http://www.statslab.cam.ac.uk/~grg/