University of Cambridge > Talks.cam > Probability > Exceptional times of the critical Erdős-Rényi graph

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar room, Old Cavendish Laboratory POM Seminar Room, Cavendish Laboratory Goldsmith's 1 & https://us06web.zoom.us/j/81688365420?pwd=b3RpdHgxNVhWbWQrbXluMUxYNWVtQT09 Meeting ID: 816 8836 5420 Passcode: 047859

Other talks

Title to be confirmed Atmospheric Methane - rise, surge, and ongoing post-surge growth. Can we mitigate the rise, and can anything be done to reduce emissions? Talk TBC Peri-Operative Medicine, and Obstetrics and Gynaecology Genomic Medicine CPC Title to be confirmed
 

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