本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2021-03-12
摘要
Y The friendship paradox is the observation that the degrees of the neighbours of a node in any 網絡 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 數學 theory of the friendship paradox, both in general as well as for specific model 網絡s, 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 網絡 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 th
※ 此為已發表論文，全文需透過期刊付費取得