Benjamin Gunby, Rutgers University

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.

See: https://sites.google.com/view/rutgersdmseminar