University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Component sizes in random graphs with given vertex degrees (the configuration model)

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

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

SNA - Theoretical foundations for statistical network analysis

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).

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity