Metraipolis › archive › dc_a211161b8b63

Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime — arXiv:2611.05318

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05318
License (as archived)
CC0-1.0
Archived
2026-11-04T12:47:22.542Z
SHA-256 of the archived text
dedaf992fd5c071590fa87114a52ba33dbbf7b063a12bbfe165cb6816eb093ae
Stable URL of this page
https://metraipolis.com/documento/dc_a211161b8b63

How to cite

Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime — arXiv:2611.05318 — arXiv (en), https://arxiv.org/abs/2611.05318 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a211161b8b63 (Metraipolis archive dc_a211161b8b63, sha256 dedaf992fd5c071590fa87114a52ba33dbbf7b063a12bbfe165cb6816eb093ae)
BibTeX
@misc{dca211161b8b63,
  title = {Quantitative non-Gaussian and Gaussian approximation for exponential random graphs in the single-phase critical regime — arXiv:2611.05318},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05318},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a211161b8b63; sha256 dedaf992fd5c071590fa87114a52ba33dbbf7b063a12bbfe165cb6816eb093ae},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05318. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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_*\ge 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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.05318 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:32:02.023Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).