Quantitative central limit theorems for exponential random graphs
Vilas Winstein
TL;DR
This work establishes quantitative central limit theorems for edge counts, subgraph counts, vertex degrees, and local subgraph counts in ferromagnetic ERGMs, including the supercritical regime where metastable wells govern fluctuations. By combining Hájek projections with concentration via mixing and a Stein's method framework for nonlinear exponential families, the authors derive explicit Wasserstein and Kolmogorov distance bounds that improve prior subcritical results and extend to phase-coexistence settings. A novel modified Hamiltonian concentrates the analysis near metastable wells, enabling precise control of error terms and cancellations that yield Gaussian fluctuations with explicit rates. The results significantly advance the understanding of microscopic fluctuations in ERGMs and provide quantitative tools for inference and prediction across parameter regimes, including local observables and subgraph counts. Overall, the paper delivers a comprehensive, rigorously quantified picture of Gaussian fluctuations in dense ERGMs under ferromagnetic interaction across multiple regimes, with broad methodological implications for probabilistic graphical models.
Abstract
Ferromagnetic exponential random graph models (ERGMs) are nonlinear exponential tilts of Erdős-Rényi models, under which the presence of certain subgraphs such as triangles may be emphasized. These models are mixtures of metastable wells which each behave macroscopically like new Erdős-Rényi models themselves, exhibiting the same laws of large numbers for the overall edge count as well as all subgraph counts. However, the microscopic fluctuations of these quantities remained elusive for some time. Building on a recent breakthrough by Fang, Liu, Shao and Zhao [FLSZ24] driven by Stein's method, we prove quantitative central limit theorems (CLTs) for these quantities and more in metastable wells under ferromagnetic ERGMs. One main novelty of our results is that they apply also in the supercritical (low temperature) regime of parameters, which has previously been relatively unexplored. To accomplish this, we develop a novel probabilistic technique based on the careful analysis of the evolution of relevant quantities under the ERGM Glauber dynamics. Our technique allows us to deliver the main input to the method developed by [FLSZ24], which is the fact that the fluctuations of subgraph counts are driven by those of the overall edge count. This was first shown for the triangle count by Sambale and Sinulis [SS20] in the Dobrushin (very high temperature) regime via functional-analytic methods. We feel our technique clarifies the underlying mechanisms at play, and it also supplies improved bounds on the Wasserstein and Kolmogorov distances between the observables at hand and the limiting Gaussians, as compared to the results of [FLSZ24] in the subcritical (high temperature) regime beyond the Dobrushin regime. Moreover, our technique is flexible enough to also yield quantitative CLTs for vertex degrees and local subgraph counts, which have not appeared before in any parameter regime.
