Wednesday, December 11, 2019 at 4:15pm to 5:15pm
Room 2-139 -- MIT - Dept. of Mathematics -- 77 Mass. Ave., Cambridge, MA
SPEAKER: Ross Berkowitz (Yale University)
TITLE: A local limit theorem for cliques
Let X denote the number of cliques of size 7 in a uniformly random graph on n vertices. What is the probability that X is exactly equal to its mean? A central limit theorem estimating the behavior of X on a large scale is a classic result, and in this talk we extend this to understanding the pointwise distribution of X. Additionally, we will examine some random variables where central limit theorems do not extend to nice local limit theorems.