Seminar series
Date
Mon, 14 May 2007
14:15
14:15
Location
DH 3rd floor SR
Speaker
Dr Oliver Riordan
Organisation
University of Cambridge (DPMS)
Recently, comparison with branching processes has been used to determine the
asymptotic behaviour of the diameter (largest graph distance between two points
that are in the same component) of various sparse random graph models, giving
results for $G(n,c/n)$ as special cases. In ongoing work with Nick Wormald, we
have studied $G(n,c/n)$ directly, obtaining much stronger results for this
simpler model.