BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Conferences/Seminars/Lectures
DESCRIPTION:SPEAKER: Ross Berkowitz (Yale University)\n\nTITLE: A local
limit theorem for cliques\n\nABSTRACT: \n\nLet X denote the number of cliqu
es of size 7 in a uniformly random graph on n vertices. What is the probabi
lity that X is exactly equal to its mean? A central limit theorem estimati
ng the behavior of X on a large scale is a classic result\, and in this tal
k we extend this to understanding the pointwise distribution of X. Additio
nally\, we will examine some random variables where central limit theorems
do not extend to nice local limit theorems.
DTEND:20191211T221500Z
DTSTAMP:20200330T232536Z
DTSTART:20191211T211500Z
GEO:42.360091;-71.09416
LOCATION:Room 2-139
SEQUENCE:0
SUMMARY:Combinatorics Seminar
UID:tag:localist.com\,2008:EventInstance_32125083318109
URL:http://calendar.mit.edu/event/combinatorics_seminar_7326
END:VEVENT
END:VCALENDAR