skip to content
 

Component sizes in random graphs with given vertex degrees (the configuration model)

Presented by: 
Svante Janson Uppsala Universitet
Date: 
Thursday 13th October 2016 - 11:30 to 12:30
Venue: 
INI Seminar Room 2
Abstract: 
We consider uniform random graphs with given vertex degrees; these are conveniently generated by the configuration model. We discuss some results on the size of the components, in particular the largest one, from the fundamental results by Molloy and Reed (1995, 1998) on the phase transition to recent work on the barely supercritical case (joint work with Malwina Luczak and Remco van der Hofstad; still in progress).

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons