Speaker
Svante Janson
(Stockholm University)
Description
The susceptibility of a graph is the average size of the
component containing a randomly chosen vertex. We
discuss the susceptibility of some random graphs, including
the standard "Erdös-Renyi" random graph G(n,p).
