Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Matthew Russell, Rutgers University, russell2 {at} math [dot] rutgers [dot] edu)
Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: How Many Triangles Are In The Random Graph?

Speaker: Ross Berkowitz, Rutgers University

Date: Thursday, April 14, 2016 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


We will formulate answers to questions of the following form: What is the probability that one has exactly the expected number of triangles in an Erdos-Renyi random graph? What if we ask about the mean plus ten, or plus two standard deviations? Counting the number of occurrences of a subgraph in an Erdos-Renyi random graph is a long studied problem, and much work has gone into proving when one has a central limit theorem. We will talk about when such results may be extended into local limit theorems.

See: http://www.math.rutgers.edu/~russell2/expmath/