Probability Seminars
Exceptional times of the critical Erdős-Rényi graph
With Matt Roberts (Bath)
Exceptional times of the critical Erdős-Rényi graph
It is well known that the largest components in the critical Erdős-Rényi graph have size of order n. 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}.
- Speaker: Matt Roberts (Bath)
- Tuesday 01 November 2016, 16:30–17:30
- Venue: MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
- Series: Probability; organiser: Perla Sousi.