Jo, Hang-Hyun and Eom, Young-Ho Generalized friendship paradox in networks with tunable degree-attribute correlation. Physical Review E, 90. 022809. ISSN 1539-3755 (2014)
|
PDF
- Published Version
Download (1MB) | Preview |
Abstract
One of the interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called the generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between degrees and attributes. However, how the GFP holds for individual nodes needs to be understood in more detail. For this, we first analyze a solvable model to characterize the paradox holding probability of nodes for the uncorrelated case. Then we numerically study the correlated model of networks with tunable degree-degree and degree-attribute correlations. In contrast to the network level, we find at the individual level that the relevance of degree-attribute correlation to the paradox holding probability may depend on whether the network is assortative or dissortative. These findings help us to understand the interplay between topological structure and node attributes in complex networks.
| Item Type: | Article |
|---|---|
| Identification Number: | 10.1103/PhysRevE.90.022809 |
| Additional Information: | © 2014 American Physical Society |
| Uncontrolled Keywords: | PACS number(s): 89.75.−k, 89.65.−s |
| Subjects: | H Social Sciences > HA Statistics Q Science > QC Physics |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 03 Dec 2014 13:52 |
| Last Modified: | 18 Dec 2014 13:54 |
| URI: | http://eprints.imtlucca.it/id/eprint/2392 |
Actions (login required)
 |
Edit Item |
