Asymptotic Properties of Random Unlabelled Block-Weighted Graphs

  • Benedikt Stufler


We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As their number of vertices tends to infinity, we show that they admit the Brownian tree as Gromov–Hausdorff–Prokhorov scaling limit, and converge in a strengthened Benjamini–Schramm sense toward an infinite random graph. We also consider models of random graphs that are allowed to be disconnected. Here a giant connected component emerges and the small fragments converge without any rescaling towards a finite random limit graph.

Our main application of these general results treats subcritical classes of unlabelled graphs. We study the special case of unlabelled outerplanar graphs in depth and calculate its scaling constant.

Article Number