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

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

• Svante Janson (Uppsala Universitet)
• Thursday 13 October 2016, 11:30-12:30
• Seminar Room 2, Newton Institute.

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.

This talk is included in these lists:

• All CMS events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Featured lists
• INI info aggregator
• Interested Talks
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 2, Newton Institute
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.