University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Exceptional times of the critical Erdős-Rényi graph

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

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

  • UserMatt Roberts (University of Bath)
  • ClockTuesday 17 October 2017, 15:00-16:00
  • HouseWatson 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 n2/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 n2/3.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.