Butts Carter T, Almquist Zack W
Departments of Sociology, Statistics, and EECS, and Institute for Mathematical Behavioral Sciences, University of California, Irvine, California, USA.
Department of Sociology, School of Statistics, and Minnesota Population Center, University of Minnesota, Minneapolis, Minnesota, USA.
J Math Sociol. 2015;39(3):163-167. doi: 10.1080/0022250X.2014.967851.
The conventional exponential family random graph model (ERGM) parameterization leads to a baseline density that is constant in graph order (i.e., number of nodes); this is potentially problematic when modeling multiple networks of varying order. Prior work has suggested a simple alternative that results in constant expected mean degree. Here, we extend this approach by suggesting another alternative parameterization that allows for flexible modeling of scenarios in which baseline expected degree scales as an arbitrary power of order. This parameterization is easily implemented by the inclusion of an edge count/log order statistic along with the traditional edge count statistic in the model specification.
传统的指数族随机图模型(ERGM)参数化会产生一个在图的阶数(即节点数)上恒定的基线密度;在对不同阶数的多个网络进行建模时,这可能会带来问题。先前的工作提出了一种简单的替代方法,该方法能产生恒定的预期平均度。在此,我们扩展了这种方法,提出了另一种替代参数化方法,它允许灵活地对基线预期度按阶数的任意幂次缩放的情况进行建模。通过在模型规范中纳入边计数/对数阶数统计量以及传统的边计数统计量,这种参数化很容易实现。