Combinatorics Seminar - Spring '21

When: Sunday, April 18, 10am

Where: Schreiber 309

Speaker: Mihyun Kang, Graz

Title: Local Limits of Random Graphs

Abstract:

In this talk we will discuss some classical and recent results on local limits of random graphs. It is well known that the limiting object of the local structure of the classical Erdos-Renyi random graph is a Galton-Watson tree. This can nicely be formalised in the language of Benjamini-Schramm or Aldous-Steele local weak convergence. Regarding local limits of a random planar graph, there is a smooth transition from a Galton-Watson tree to a Skeleton tree.

This talk is based on joint work with Michael Missethan.