University of Cambridge > > Probability > 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

If you have a question about this talk, please contact Perla Sousi.

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}.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity