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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

St Johns Women Society CUSEAF Cambridge Language Sciences Annual Symposium Alfaisal University Engineering Seminars Wolfson Brain Imaging Centre Open Cambridge talks

Other talks

RA250 at the Fitz: academicians celebrating 250 years of the Royal Academy Barnum, Bache and Poe: the forging of science in the Antebellum US What we don’t know about the Universe from the very small to the very big : ONE DAY MEETING Developing novel methods for interrogating tree ring anatomy for use in modelling carbon sequestration Queer stories at the Museum Imaging surfaces with atoms
 

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