Dávid Kunszenti-Kovács: On the convergence of unbounded W-random models

Speaker: Dávid Kunszenti-Kovács

Title: On the convergence of unbounded W-random models

Abstract: We shall take a look at the convergence properties of W-random graph models in the cut/jumble norm, where W is an unbounded graphon. The dense kappa-PAG graphon family will serve a toy model and highlight the difficulties compared to the bounded graphon case. Joint work with Ágnes Backhausz.