Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime
Abstract
We establish quantitative non-Gaussian and Gaussian approximations for edge-count fluctuations in dense exponential random graphs at single-phase criticality of any fixed even order 2m*≥ 4. The Hamiltonians use injective homomorphism counts of fixed simple graphs, with nonnegative leading coefficients for the higher-order terms. In bounded calibrated windows, edge-density fluctuations on the scale n−1/m* admit an explicit non-Gaussian approximation with error O(n−1/m*). For parameter perturbations by fixed multiples of n−1 with a nonzero first-order drift correction at the critical density, the deterministically centered edge count admits a Gaussian approximation on the scale n(3m*−2)/(2m*−1), with error O(n−1/(2m*−1)). Both rates hold in Wasserstein and Kolmogorov distances. The key step is to construct auxiliary kernels for exterior graphs outside an event of exponentially small probability. These kernels contract uniformly on the full row state space and agree with the conditional Gibbs updates on typical row configurations, yielding the conditional cumulant estimates used in Stein's method.
Related
- Critical fluctuations in the edge--triangle exponential random graph models
- Discontinuous Galerkin Approximation to a Class of Strongly Damped Wave Equations with Uniform Exponential Decay
- Limiting Behavior of a Class of Hermitian Yang--Mills Metrics, II: Exponential Approximation
- On the Exponential Circuit Imbalance of the Ben-Tal Nemirovski Approximation
- Approximation by short exponential sums with geometric error decay based on Gauss quadrature
BibTeX
@misc{zhao2026quantitative,
title = {{Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime}},
author = {Yi-Kun Zhao},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.05318},
eprint = {2611.05318},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.05318},
}
RIS
TY - UNPB
TI - Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime
AU - Yi-Kun Zhao
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.05318
UR - https://arxiv.org/abs/2611.05318
AB - We establish quantitative non-Gaussian and Gaussian approximations for edge-count fluctuations in dense exponential random graphs at single-phase criticality of any fixed even order 2m_*≥ 4. The Hamiltonians use injective homomorphism counts of fixed simple graphs, with nonnegative leading coefficients for the higher-order terms. In bounded calibrated windows, edge-density fluctuations on the scale n^−1/m_* admit an explicit non-Gaussian approximation with error O(n^−1/m_*). For parameter perturbations by fixed multiples of n^−1 with a nonzero first-order drift correction at the critical density, the deterministically centered edge count admits a Gaussian approximation on the scale n^(3m_*−2)/(2m_*−1), with error O(n^−1/(2m_*−1)). Both rates hold in Wasserstein and Kolmogorov distances. The key step is to construct auxiliary kernels for exterior graphs outside an event of exponentially small probability. These kernels contract uniformly on the full row state space and agree with the conditional Gibbs updates on typical row configurations, yielding the conditional cumulant estimates used in Stein's method.
ER -