BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Component sizes in random graphs with given vertex degrees (the co
 nfiguration model) - Svante Janson (Uppsala Universitet)
DTSTART:20161013T103000Z
DTEND:20161013T113000Z
UID:TALK68128@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:<span>We consider uniform random graphs with given vertex degr
 ees\; these are conveniently generated by the configuration model. We disc
 uss some results on the size of the components\, in particular the largest
  one\, from the fundamental results by Molloy and Reed (1995\, 1998) on th
 e phase transition to recent work on the barely supercritical case (joint 
 work with Malwina Luczak and Remco van der Hofstad\; still in progress).<b
 r> <br> </span>
LOCATION:Seminar Room 2\, Newton Institute
END:VEVENT
END:VCALENDAR