The friendship paradox in real and model networks
Journal of Complex Networks · 05.05.2021 · 9 (2)
DOI: 10.1093/comnet/cnab011 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Complex Networks, online erschienen am 27.05.2021. Verfasst von George T Cantwell und 2 weiteren Autor:innen. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: US National Science Foundation, US Department of Defense NDSEG fellowship program.
Abstract (Originalsprache)
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.
Förderung
- US National Science Foundation
- US Department of Defense NDSEG fellowship program
Zitieren
APA
Cantwell, G. T., Kirkley, A., & Newman, M. E. J. (2021). The friendship paradox in real and model networks. Journal of Complex Networks, 9(2). https://doi.org/10.1093/comnet/cnab011
Vancouver
Cantwell GT, Kirkley A, Newman MEJ. The friendship paradox in real and model networks. Journal of Complex Networks. 2021;9(2). doi:10.1093/comnet/cnab011
BibTeX
@article{Cantwell2021,
author = {Cantwell, George T and Kirkley, Alec and Newman, M E J},
title = {The friendship paradox in real and model networks},
journal = {Journal of Complex Networks},
year = {2021},
volume = {9},
number = {2},
doi = {10.1093/comnet/cnab011}
}
EUVIMED