List All Events

Discrete Math

Local Limit Theorems on Random Graphs

Ross Berkowitz, Yale

Location:  Hill 705
Date & time: Monday, 12 November 2018 at 2:00PM - 3:00PM

Abstract: What is the probability that a random graph has exactly the average number of copies of $$K_5$$? We will discuss a new technique developed since our last talk at Rutgers for analyzing the characteristic functions of low degree polynomials over $$G(n,p)$$. This will allow us to prove local limit theorems for cliques of any fixed size in $$G(n,1/2)$$.