![]() |
|
statnetIntroductionInstallation Online Users Guide Resources Papers and Preprints statnet Users Group About Us Citing statnet License and source code attribution requirements |
StatnetPractical Statistical Models for NetworksRecent developments in exponential random graph (p*) models THURSDAY 2/16 12:00-2:00pm Redondo 1
Co-Chairs
Presenters In this special session we outline the recent developments in exponential random graph models (ERGM, also known as p*) that now make them a practical and useful tool for the statistical analysis of social networks. It has been customary to use a Markov random graph specification (Frank & Strauss, 1986; Wasserman & Pattison, 1996) when applying p* models to data. But most commonly used Markov graph models do not represent observed social networks well. The resulting estimated models are often near degenerate, and in such cases coherent parameter estimates can not be obtained. The problem of degeneracy is a function of both the fit of a specific model, and the sensitivity of the general modeling framework. Over the past few years, substantial progress has been made in understanding both of these issues and the connection between them. Statistical theory has been developed to define and analyze the problem of degeneracy (Handcock 2003). New model specifications have been proposed that help to avoid degenerate estimates (Snijders, Pattison, Robins and Handcock, 2005). And computer packages are being developed to implement general ERGM estimation using maximum likelihood (rather than pseudo-likelihood). The result is improved robustness, accuracy, diagnostics and ability to handle missing data.
Sunbelt XXV The special session will include:
Computer packages for statistical analysis of networks:
SIENA: http://stat.gamma.rug.nl/siena.html
|