Outliers and Influential Observations in Exponential Random Graph Models

we discuss measuring and detecting influential observations and outliers in the context of exponential family random graph (erg) models for social networks. we focus on the level of the nodes of the network and consider those nodes whose removal would result in changes to the model as extreme or “central” with respect to the structural features that “matter”. we construe removal in terms of two case-deletion strategies: the tie-variables of an actor are assumed to be unobserved, or the node is removed resulting in the induced subgraph. we define the difference in inferred model resulting from case deletion from the perspective of information theory and difference in estimates, in both the natural and mean-value parameterisation, representing varying degrees of approximation. we arrive at several measures of influence and propose the use of two that do not require refitting of the model and lend themselves to routine application in the ergm fitting procedure. mcmc p values are obtained for testing how extreme each node is with respect to the network structure. the influence measures are applied to two well-known data sets to illustrate the information they provide. from a network perspective, the proposed statistics offer an indication of which actors are most distinctive in the network structure, in terms of not abiding by the structural norms present across other actors.