The phase transition in the random d-process

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

• Lutz Warnke (University of Cambridge; Georgia Institute of Technology)
• Thursday 29 September 2016, 11:00-12:00
• Seminar Room 2, Newton Institute.

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

SNA - Theoretical foundations for statistical network analysis

One of the most interesting features of Erdös-Rényi random graphs is the `percolation phase transition', where the global structure intuitively changes from only small components to a single giant component plus small ones. In this talk we discuss the percolation phase transition in the random d-process, which corresponds to a natural algorithmic model for generating random regular graphs that differs from the usual configuration model (starting with an empty graph on n vertices, the random d-process evolves by sequentially adding new random edges so that the maximum degree remains at most d). Our results on the phase transition solve a problem of Wormald from 1997, and verify a conjecture of Balinska and Quintas from 1990. 　 Based on joint work with Nick Wormald.

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

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 2, Newton Institute
• bld31

Note that ex-directory lists are not shown.