Quantitative central limit theorems for exponential random graphs
Vilas Winstein

TL;DR
This paper establishes quantitative central limit theorems for subgraph counts and related quantities in ferromagnetic exponential random graph models, including the challenging low-temperature regime, using a novel probabilistic approach based on Glauber dynamics.
Contribution
It introduces a new probabilistic technique to prove CLTs for ERGMs, applicable across all temperature regimes, and extends results to vertex degrees and local subgraph counts.
Findings
Quantitative CLTs hold for subgraph counts in ERGMs.
Technique applies to supercritical (low temperature) regimes.
Provides bounds on Wasserstein and Kolmogorov distances.
Abstract
Ferromagnetic exponential random graph models (ERGMs) are nonlinear exponential tilts of Erd\H{o}s-R\'enyi 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\H{o}s-R\'enyi 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Graph theory and applications · Complex Network Analysis Techniques
