BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UIC
BEGIN:VEVENT
UID:2024110504214820241111T15000020241111T155000672a461c7bc3d@uic.edu
CATEGORIES:MEETING
STATUS:TENTATIVE
DTSTAMP:20241104T042235
DTSTART:20241111T150000
DTEND:20241111T155000
SUMMARY:Combinatorics and Discrete Probability Seminar: Notes on two-point concentration of the independence number of the random graph, by Tom Bohman
DESCRIPTION:Tom Bohman (Carnegie Mellon University): Notes on two-point concentration of the independence number of the random graph It is well known that for any constant probability p there exists a function k(n) such that the independence number of the binomial random graph G(n,p) is concentrated on two values (i.e.the independence number of G(n,p) is k(n) or k(n)+1 with high probability). In this talk we discuss the extension of this result to p(n) that tends to 0 with n. In particular, we determine the probability at which two point concentration of the independence number of G(n,p) breaks down. We also discuss the independence number of G(n,m), and show that there is a range of values for m in which the independence number of G(n,m) is concentrated on two values while the independence number of the corresponding G(n,p) is not concentrated on two values. Joint work with Jakob Hofstad. Please click here to make changes to, or delete, this seminar announcement. | Event post: https://mscs.uic.edu/events?page_id=5191118
LOCATION:1227 SEO Chicago IL
CLASS:PRIVATE
END:VEVENT
END:VCALENDAR