File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1093/comnet/cnab011
- Scopus: eid_2-s2.0-85107905369
- WOS: WOS:000750884500003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The friendship paradox in real and model networks
Title | The friendship paradox in real and model networks |
---|---|
Authors | |
Keywords | assortative mixing friendship paradox generalized friendship paradox generating functions random graphs real-world networks |
Issue Date | 2021 |
Citation | Journal of Complex Networks, 2021, v. 9, n. 2, article no. cnab011 How to Cite? |
Abstract | 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. |
Persistent Identifier | http://hdl.handle.net/10722/317043 |
ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 0.511 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cantwell, George T. | - |
dc.contributor.author | Kirkley, Alec | - |
dc.contributor.author | Newman, M. E.J. | - |
dc.date.accessioned | 2022-09-19T06:18:40Z | - |
dc.date.available | 2022-09-19T06:18:40Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Journal of Complex Networks, 2021, v. 9, n. 2, article no. cnab011 | - |
dc.identifier.issn | 2051-1310 | - |
dc.identifier.uri | http://hdl.handle.net/10722/317043 | - |
dc.description.abstract | 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. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Complex Networks | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | assortative mixing | - |
dc.subject | friendship paradox | - |
dc.subject | generalized friendship paradox | - |
dc.subject | generating functions | - |
dc.subject | random graphs | - |
dc.subject | real-world networks | - |
dc.title | The friendship paradox in real and model networks | - |
dc.type | Article | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1093/comnet/cnab011 | - |
dc.identifier.scopus | eid_2-s2.0-85107905369 | - |
dc.identifier.volume | 9 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | article no. cnab011 | - |
dc.identifier.epage | article no. cnab011 | - |
dc.identifier.eissn | 2051-1329 | - |
dc.identifier.isi | WOS:000750884500003 | - |