eprintid: 2390 rev_number: 14 eprint_status: archive userid: 6 dir: disk0/00/00/23/90 datestamp: 2014-12-03 11:47:33 lastmod: 2014-12-18 13:54:51 status_changed: 2014-12-03 11:47:33 type: article metadata_visibility: show creators_name: Eom, Young-Ho creators_name: Jo, Hang-Hyun creators_id: youngho.eom@imtlucca.it creators_id: title: Generalized friendship paradox in complex networks: the case of scientific collaboration ispublished: pub subjects: HA subjects: Q1 subjects: QC subjects: Z665 divisions: CSA full_text_status: public keywords: Applied mathematics; Computational science; Scientific data; Complex networks 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. date: 2014-04 publication: Scientific Reports volume: 4 publisher: Nature Publishing Group pagerange: 4603 id_number: doi:10.1038/srep04603 refereed: TRUE issn: 2045-2322 official_url: http://dx.doi.org/10.1038/srep04603 projects: EC FET Open project ‘‘New tools and algorithms for directed network analysis’’ (NADINE number 288956) citation: Eom, Young-Ho and Jo, Hang-Hyun Generalized friendship paradox in complex networks: the case of scientific collaboration. Scientific Reports, 4. p. 4603. ISSN 2045-2322 (2014) document_url: http://eprints.imtlucca.it/2390/1/Scient.Rep_Eom_2014.pdf