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

Young Ho Eom; Hang Hyun Jo

doi:10.1038/srep04603

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

Young Ho Eom
, Hang Hyun Jo

Physics

Université Paul Sabatier

Research output: Contribution to journal › Article › peer-review

80 Scopus citations

Abstract

The friendship paradox states that your friends have on average more friends than you have. Does the paradox a "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.

Original language	English
Article number	4603
Journal	Scientific Reports
Volume	4
DOIs	https://doi.org/10.1038/srep04603
State	Published - 8 Apr 2014

Bibliographical note

Funding Information:
The authors thank Daniel Kim and Hawoong Jeong for providing Google Scholar data and American Physical Society for providing Physical Review bibliographic data. Y.-H.E. acknowledges support from the EC FET Open project ‘‘New tools and algorithms for directed network analysis’’ (NADINE number 288956). H.-H.J. acknowledges financial support by the Aalto University postdoctoral programme.

Access to Document

10.1038/srep04603

Cite this

@article{43bb4a7550b94b5aa665afebc32afb35,

title = "Generalized friendship paradox in complex networks: The case of scientific collaboration",

abstract = "The friendship paradox states that your friends have on average more friends than you have. Does the paradox a {"}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.",

author = "Eom, \{Young Ho\} and Jo, \{Hang Hyun\}",

note = "Funding Information: The authors thank Daniel Kim and Hawoong Jeong for providing Google Scholar data and American Physical Society for providing Physical Review bibliographic data. Y.-H.E. acknowledges support from the EC FET Open project {\textquoteleft}{\textquoteleft}New tools and algorithms for directed network analysis{\textquoteright}{\textquoteright} (NADINE number 288956). H.-H.J. acknowledges financial support by the Aalto University postdoctoral programme.",

year = "2014",

month = apr,

day = "8",

doi = "10.1038/srep04603",

language = "English",

volume = "4",

journal = "Scientific Reports",

issn = "2045-2322",

publisher = "Nature Research",

}

TY - JOUR

T1 - Generalized friendship paradox in complex networks

T2 - The case of scientific collaboration

AU - Eom, Young Ho

AU - Jo, Hang Hyun

N1 - Funding Information: The authors thank Daniel Kim and Hawoong Jeong for providing Google Scholar data and American Physical Society for providing Physical Review bibliographic data. Y.-H.E. acknowledges support from the EC FET Open project ‘‘New tools and algorithms for directed network analysis’’ (NADINE number 288956). H.-H.J. acknowledges financial support by the Aalto University postdoctoral programme.

PY - 2014/4/8

Y1 - 2014/4/8

N2 - The friendship paradox states that your friends have on average more friends than you have. Does the paradox a "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.

AB - The friendship paradox states that your friends have on average more friends than you have. Does the paradox a "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.

UR - https://www.scopus.com/pages/publications/84898416584

U2 - 10.1038/srep04603

DO - 10.1038/srep04603

M3 - Article

C2 - 24714092

AN - SCOPUS:84898416584

SN - 2045-2322

VL - 4

JO - Scientific Reports

JF - Scientific Reports

M1 - 4603

ER -

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

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this