Seminar at SMU Delhi
February 19, 2020 (Wednesday) ,
3:30 PM at Webinar
National University of Singapore
Higher-order fluctuations in dense graph limit theory
Abstract of Talk
For random graphs generated according to a symmetric measurable function $\kappa$ at random points, we show that there exists an orthogonal decomposition for the generalised U-statistics for subgraph counts. For such random graphs, we obtain the multivariate normal approximation of the "signed subgraph statistics", which spans the space of graph functions. Further, we provide rates of convergence for these limits and develop the Stein's method for multivariate normal approximation to handle the sum of dependent, but uncorrelated random vectors.