Closure , connectivity and degrees : New specifications for exponential random graph ( p * ) models for directed social networks

@inproceedings{Robins2006ClosureC,
title={Closure , connectivity and degrees : New specifications for exponential random graph ( p * ) models for directed social networks},
author={Garry Robins and Pip Pattison and Peng Wang},
year={2006}
}

The new higher order specifications for exponential random graph models introduced by Snijders, Pattison, Robins & Handcock (2006) exhibit dramatic improvements in model fit compared with the commonly used Markov random graphs. Snijders et al briefly presented versions of these new specifications for directed graphs, in particular a directed alternating ktriangle parameter, based on closure of multiple two-paths. In this paper, we present a number of additional higher order parameters for… CONTINUE READING