A central limit theorem for singular graphons
Abstract
We associate to a graphon γ the sequence of W-random graphs (Gn(γ))n ≥ 1. We say that the graphon is singular if, for any finite graph F, the homomorphism density t(F,Gn(γ)) has a variance of order O(n-2). This behavior is singular because generically, the density of a fixed finite graph F in a W-random graph has a variance of order O(n-1). We conjecture that the only singular graphons are the constant graphons γp with p ∈ [0,1], corresponding to the Erdos-R\'enyi random graphs 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 Erdos-R\'enyi random graphs. In particular, if γ is a singular graphon, then the scaled densities n(t(F,Gn(γ))-E[t(F,Gn(γ))]) converge in joint distribution. This generalises the central limit theorem satisfied by the Erdos-R\'enyi random graphs 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(γ) associated to a singular graphon; this opens the way to a spectral approach of the conjecture.