Upper Tails of Subgraph Counts in Sparse Regular Graphs

Start Date: September 13, 2021
Event Start Time: 2:00 PM
Event End Time: 3:00 PM
Seminar Series: Rutgers Discrete Mathematics Seminar
Presenter(s): Benjamin Gunby - Rutgers University
Event Location: Hill Center-Room 705
Event Additional Info: <p>See: <a href="https://sites.google.com/view/rutgersdmseminar">https://sites.google.com/view/rutgersdmseminar</a></p>
Presentation Type: Stand Alone Presentation
Abstract:
Given a random graph G, what is the probability that it contains a constant fraction more copies of a fixed graph K than expected? This question has been well-studied when G is the ErdÅ‘s–Rényi graph G(n,p). When G is instead a random d-regular graph G_{n,d}, when K is also regular this question was answered by Bhattacharya and Dembo. We discuss several new results in the case where K is not regular, including surprising behavior that does not show up in the ErdÅ‘s–Rényi case.

Events