Newman M E J, Park Juyong
Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, Michigan 48109, USA.
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Sep;68(3 Pt 2):036122. doi: 10.1103/PhysRevE.68.036122. Epub 2003 Sep 22.
We argue that social networks differ from most other types of networks, including technological and biological networks, in two important ways. First, they have nontrivial clustering or network transitivity and second, they show positive correlations, also called assortative mixing, between the degrees of adjacent vertices. Social networks are often divided into groups or communities, and it has recently been suggested that this division could account for the observed clustering. We demonstrate that group structure in networks can also account for degree correlations. We show using a simple model that we should expect assortative mixing in such networks whenever there is variation in the sizes of the groups and that the predicted level of assortative mixing compares well with that observed in real-world networks.
我们认为,社交网络在两个重要方面不同于大多数其他类型的网络,包括技术网络和生物网络。第一,它们具有非平凡的聚类或网络传递性;第二,它们在相邻顶点的度数之间呈现正相关,也称为同配混合。社交网络通常被划分为群组或社区,最近有人提出这种划分可以解释观察到的聚类现象。我们证明,网络中的群组结构也可以解释度数相关性。我们使用一个简单的模型表明,只要群组大小存在差异,我们就应该预期此类网络中会出现同配混合,并且预测的同配混合水平与在现实世界网络中观察到的水平相当。