English

A central limit theorem for singular graphons

Probability 2021-03-30 v1 Combinatorics

Abstract

We associate to a graphon γ\gamma the sequence of WW-random graphs (Gn(γ))n1(G_n(\gamma))_{n \geq 1}. We say that the graphon is singular if, for any finite graph FF, the homomorphism density t(F,Gn(γ))t(F,G_n(\gamma)) has a variance of order O(n2)O(n^{-2}). This behavior is singular because generically, the density of a fixed finite graph FF in a WW-random graph has a variance of order O(n1)O(n^{-1}). We conjecture that the only singular graphons are the constant graphons γp\gamma_p with p[0,1]p \in [0,1], corresponding to the Erd\H{o}s-R\'enyi random graphs G(n,p)G(n,p). In this paper, we investigate the general properties of the singular graphons, and we show that they share many properties with the Erd\H{o}s-R\'enyi random graphs. In particular, if γ\gamma is a singular graphon, then the scaled densities n(t(F,Gn(γ))E[t(F,Gn(γ))])n(t(F,G_n(\gamma))-\mathbb{E}[t(F,G_n(\gamma))]) converge in joint distribution. This generalises the central limit theorem satisfied by the Erd\H{o}s-R\'enyi random graphs G(n,p)G(n,p); however, the limiting distribution might be non-Gaussian if the conjecture does not hold. We also establish an equation satisfied by the characteristic polynomial of the Laplacian of the graph Gn(γ)G_n(\gamma) associated to a singular graphon; this opens the way to a spectral approach of the conjecture.

Keywords

Cite

@article{arxiv.2103.15741,
  title  = {A central limit theorem for singular graphons},
  author = {Pierre-Loïc Méliot},
  journal= {arXiv preprint arXiv:2103.15741},
  year   = {2021}
}

Comments

49 pages, 6 figures, 3 tables

R2 v1 2026-06-24T00:39:26.817Z