  We prove a central limit theorem for network moments in a model of network
formation with strategic interactions and homophilous agents. Since data often
consists of observations on a single large network, we consider an asymptotic
framework in which the network size diverges. We argue that a modification of
"exponential stabilization" conditions from the literature on geometric graphs
provides a useful high-level formulation of weak dependence, which we use to
establish an abstract central limit theorem. We then derive primitive
conditions for stabilization using results in branching process theory. We
discuss practical inference procedures justified by our results and outline a
methodology for deriving primitive conditions that can be applied more broadly
to other large network models with strategic interactions.
