Seminar Details
Local Limit Theorems on Random Graphs
- Start Date: November 12, 2018
- Event Start Time: 2:00 PM
- Event End Time: 3:00 PM
- Seminar Series: Rutgers Discrete Mathematics Seminar
- Presenter(s): Ross Berkowitz - Rutgers University
- Event Location: Hill Center-Room 705
- Presentation Type: Stand Alone Presentation
- 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)$