REVIEW 1 cited by
Second-order Approximation of Exponential Random Graph Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Exponential random graph models (ERGMs) are flexible probability models allowing edge dependency. However, it is known that, to a first-order approximation, many ERGMs behave like Erd\"os-R\'enyi random graphs, where edges are independent. In this paper, to distinguish ERGMs from Erd\"os-R\'enyi random graphs, we consider second-order approximations of ERGMs using two-stars and triangles. We prove that the second-order approximation indeed achieves second-order accuracy in the triangle-free case. The new approximation is formally obtained by Hoeffding decomposition and rigorously justified using Stein's method.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.