The friendship paradox in real and model networks
The friendship paradox in real and model networks
复制标题
DOI：
10.1093/comnet/cnab011
复制
发表时间：
2021-04-01
影响因子：
2.1
通讯作者：
Newman, M. E. J.
中科院分区：
文献类型：
--
作者：
Cantwell, George T.;Kirkley, Alec;Newman, M. E. J.
友谊悖论是观察到任何网络中节点的邻居的度平均将大于节点本身的度。用通俗的话说，你的朋友比你有更多的朋友。在这篇文章中，我们发展了友谊悖论的数学理论，无论是在一般情况下还是在特定的模型网络中，不仅关注平均行为，而且关注平均值的变化，并使用生成函数方法来计算感兴趣的数量的全分布。我们将我们的理论预测与大量真实网络数据集的测量结果进行了比较，发现非常吻合。我们还开发了等效理论的广义友谊悖论，比较节点的特性，而不是程度，他们的邻居。
Y The friendship paradox is the observation that the degrees of the neighbours of a node in any network will, on average, be greater than the degree of the node itself. In common parlance, your friends have more friends than you do. In this article, we develop the mathematical theory of the friendship paradox, both in general as well as for specific model networks, focusing not only on average behaviour but also on variation about the average and using generating function methods to calculate full distributions of quantities of interest. We compare the predictions of our theory with measurements on a large number of real-world network datasets and find remarkably good agreement. We also develop equivalent theory for the generalized friendship paradox, which compares characteristics of nodes other than degree to those of their neighbours.