Generalized friendship paradox in complex networks : the case of scientific collaboration

Tools

Eom, Young-Ho and Jo, Hang-Hyun (2014) Generalized friendship paradox in complex networks : the case of scientific collaboration. Scientific Reports, 4. 4603. ISSN 2045-2322 (https://doi.org/10.1038/srep04603)

[thumbnail of Eom-Jo-SR-2014-Gerenalized-friendship-paradox-in-complex networks]
Preview
 Text. Filename: Eom_Jo_SR_2014_Gerenalized_friendship_paradox_in_complex_networks.pdf
Final Published Version
License: Creative Commons Attribution-NonCommercial-ShareAlike 3.0 logo
Download (917kB)| Preview

Abstract

The friendship paradox states that your friends have on average more friends than you have. Does the paradox ‘‘hold’’ for other individual characteristics like income or happiness? To address this question, we generalize the friendship paradox for arbitrary node characteristics in complex networks. By analyzing two coauthorship networks of Physical Review journals and Google Scholar profiles, we find that the generalized friendship paradox (GFP) holds at the individual and network levels for various characteristics, including the number of coauthors, the number of citations, and the number of publications. The origin of the GFP is shown to be rooted in positive correlations between degree and characteristics. As a fruitful application of the GFP, we suggest effective and efficient sampling methods for identifying high characteristic nodes in large-scale networks. Our study on the GFP can shed lights on understanding the interplay between network structure and node characteristics in complex networks.

CORE (COnnecting REpositories)