Hunter David R, Krivitsky Pavel N, Schweinberger Michael
Department of Statistics, Pennsylvania State University, University Park, PA (
J Comput Graph Stat. 2012 Dec 1;21(4):856-882. doi: 10.1080/10618600.2012.732921.
We review the broad range of recent statistical work in social network models, with emphasis on computational aspects of these methods. Particular focus is applied to exponential-family random graph models (ERGM) and latent variable models for data on complete networks observed at a single time point, though we also briefly review many methods for incompletely observed networks and networks observed at multiple time points. Although we mention far more modeling techniques than we can possibly cover in depth, we provide numerous citations to current literature. We illustrate several of the methods on a small, well-known network dataset, Sampson's monks, providing code where possible so that these analyses may be duplicated.
我们回顾了近期社会网络模型方面广泛的统计工作,重点关注这些方法的计算方面。特别关注单时间点观测的完整网络数据的指数族随机图模型(ERGM)和潜变量模型,不过我们也简要回顾了许多针对不完全观测网络以及多时间点观测网络的方法。尽管我们提及的建模技术远多于能够深入探讨的数量,但我们提供了众多当前文献的引用。我们在一个小的、知名的网络数据集——桑普森的僧侣数据集上展示了几种方法,并尽可能提供代码以便重复这些分析。