For subcritical exponential random graphs conditioned on edge count, the two-star count satisfies a central limit theorem with explicit mean and variance, at rate n^{-1/2+ε} in Wasserstein distance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Conditional central limit theorems for exponential random graphs
For subcritical exponential random graphs conditioned on edge count, the two-star count satisfies a central limit theorem with explicit mean and variance, at rate n^{-1/2+ε} in Wasserstein distance.