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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Destination wedding planners Zoom: https://us02web.zoom.us/j/86705370977?pwd=ak1XblJvRFFWVllSYU1wUFc3bG91QT09 Live Zoom webinar, followed by Q&A session

Other talks

TBC Online Causal Inference Seminar Cultural evolution creates language-like structure: from humans to humpback whales and beyond Title to be confirmed A Few Days in Patagonia - the Deep South FILM: One With The Whale
 

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