指数随机图模型
友谊
二进制数
计算机科学
理论计算机科学
集合(抽象数据类型)
随机图
指数函数
编队网络
图形
心理学
数学
社会心理学
万维网
算术
数学分析
程序设计语言
作者
Andrew Pilny,Yannick Atouba
标识
DOI:10.1177/0893318917737179
摘要
For years, organizational communication scholars have been interested in the mechanisms that influence the formation of communication networks. One way to gain a deeper insight into the factors that shape such networks is to model them using exponential random graph modeling (ERGM). However, ERGM has only been applicable to binary networks, reducing communication to something that is either present or not. This article illustrates valued ERGM for organizational communication networks that have a weight associated with each tie. Using a data set on friendship strength between collaborative scientists, results show there are important differences when the network is modeled as binary versus when modeled as valued. In particular, the valued model showed that scientists are more selective regarding friendship (less outdegree activity). Moreover, there were several differences regarding how popular certain disciplines were over others. An online appendix with the R code and data is also included.
科研通智能强力驱动
Strongly Powered by AbleSci AI