CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Algorithms, Combinatorics and Optimization Seminar
Swastik Kopparty
Rutgers University
Title: A local central limit theorem for triangles in a random graph

Abstract: What is the distribution of the number of triangles in the random graph G(n, 1/2)? It was known for a long time that this distribution obeys a central limit theorem: from the point of view of large intervals (~standard-deviation length), the distribution looks like a Gaussian random variable. We show that it even obeys a LOCAL central limit theorem: the distribution is pointwise close to a suitable discrete Gaussian random variable.

Joint work with Justin Gilmer.

Date: Thursday, October 29, 2015
Time: 3:30 pm
Location: Wean Hall 8220