Exceptional times of the critical Erdős-Rényi graph

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

• Matt Roberts (University of Bath)
• Tuesday 17 October 2017, 15:00-16:00
• Watson LTA.

If you have a question about this talk, please contact Guillem Perarnau.

It is well known that the largest components in the critical Erdős-Rényi graph have size of order n^2/3. We introduce a dynamic Erdős-Rényi graph by rerandomising each edge at rate 1, and ask whether there exist times in [0,1] at which the largest component is significantly larger than n^2/3.

This talk is part of the Combinatorics and Probability Seminar series.

This talk is included in these lists:

• Combinatorics and Probability Seminar
• School of Mathematics Events
• Watson LTA

Note that ex-directory lists are not shown.