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 largescale networks. Our study on the GFP can shed lights on understanding the interplay between network structure and node characteristics in complex networks.
Similar content being viewed by others
Introduction
People live in social networks. Various behaviors of individuals are significantly influenced by their positions in such networks, whether they are offline or online^{1,2,3}. Through the interaction and communication among individuals, information, behaviors and diseases spread^{4,5,6,7,8,9,10}. Thus understanding the structure of social networks could enable us to understand, predict and even control social collective behaviors taking place on or via those networks. Social networks have been known to be heterogeneous, characterized by broad distributions of the number of neighbors or degree^{11}, assortative mixing^{12} and community structure^{13} to name a few.
One of interesting phenomena due to the structural heterogeneity in social networks is the friendship paradox^{14}. The friendship paradox (FP) can be formulated at individual and network levels, respectively. At the individual level, the paradox holds for a node if the node has smaller degree than the average degree of its neighbors. It has been shown that the paradox holds for most of nodes in both offline and online social networks^{14,15,16}. However, most people believe that they have more friends than their friends have^{17}. The paradox holds for a network if the average degree of nodes in the network is smaller than the average degree of their neighbors^{14}. The paradox can be understood as a sampling bias in which individuals having more friends are more likely to be observed by their friends. This bias has important implications for the dynamical processes on social networks, especially when it is crucial for the process to identify individuals having many neighbors, or high degree nodes. For example, let us consider the spreading process on networks. It turns out that sampling neighbors of random individuals is more effective and efficient than sampling random individuals for the early detection of epidemic spreading in largescale social networks^{18,19} and for developing efficient immunization strategies in computer networks^{20}. Recently, the information overwhelming or spam in social networking services like Twitter^{16} has been also explained in terms of the friendship paradox.
The friendship paradox has been considered only as the topological structure of social networks, mainly by focusing on the number of neighbors, among many other node characteristics. Each individual could be described by his/her cultural background, gender, age, job, personal interests and genetic information^{21,22}. This is also the case for other kinds of networks: Web pages have their own fitness in World Wide Web^{23} and scientific papers have intrinsic attractiveness in a citation network^{24}. These characteristics play significant roles in dynamical processes on complex networks^{21,22,23,24,25}. Hence, one can ask the question: Can the friendship paradox be applied to node characteristics other than degree?
To address this question, we generalize the friendship paradox for arbitrary node characteristics including degree. Similarly to the FP, our generalized friendship paradox (GFP) can be formulated at individual and network levels. The GFP holds for a node if the node has lower characteristic than the average characteristic of its neighbors. The GFP holds for a network if the average characteristic of nodes in the network is smaller than the average characteristic of their neighbors. When the degree is considered as the node characteristic, the GFP reduces to the FP. In this paper, by analyzing two coauthorship networks of physicists and of network scientists, we show that your coauthors have more coauthors, more citations and more publications than you have. This indicates that the friendship paradox holds not only for degree but also for other node characteristics. We also provide a simple analysis to show that the origin of the GFP is rooted in the positive correlation between degree and node characteristics. As applications of the GFP, two sampling methods are suggested for sampling nodes with high characteristics. We show that these methods are simple yet effective and efficient in largescale social networks.
Results
Generalized friendship paradox in complex networks
We consider two coauthorship networks constructed from the bibliographic information of Physical Review (PR) journals and Google Scholar (GS) profile dataset of network scientists (See Method Section). Each node of a network denotes an author of papers and a link is established between two authors if they wrote a paper together. The number of nodes, denoted by N, is 242592 for the PR network and 29968 for the GS network. For the node characteristics in the PR network, we consider the number of coauthors, the number of citations, the number of publications and the average number of citations per publication. As for the GS network, the number of coauthors and the number of citations are considered. The characteristic of node i will be denoted by x_{i} and for the degree we denote it by k_{i}.
The generalized friendship paradox (GFP) can be studied at two different levels: (i) Individual level and (ii) network level.
(i) Individual level
The GFP holds for a node i if the following condition is satisfied:
where Λ_{i} denotes the set of neighbors of node i. Note that setting x_{i} = k_{i} reduces the GFP to the FP. We define the paradox holding probability h(k, x) that a node with degree k and characteristic x satisfies the condition in Eq. (1). Figure 1 shows the empirical results of h(k, x) for PR and GS networks. It is found that for fixed degree k, h(k, x) decreases with increasing x for any characteristic x other than k (Fig. 1 (b–d,f)). The same decreasing tendency has been observed for x = k (Fig. 1 (a,e)). In Eq. (1), the larger value of x_{i} is expected to lower the probability h(k, x) if the characteristics of node i's neighbors remain the same. As a limiting case, the node with minimum value of x, i.e., x_{min}, is most likely to have friends with higher values of x, leading to h(k, x_{min}) = 1. On the other hand, for the node with maximum value of x, we get h(k, x_{max}) = 0.
Next, the dependence of h(k, x) on the degree k can be classified as either increasing or being constant. Here the case of x denoting the degree is disregarded for both networks. The increasing behavior is observed mainly for the number of citations and the number of publications in the PR network in Fig. 1 (b,c), while the constant behavior is observed for the average number of citations per publication in the PR network and for the number of citations in the GS network, shown in Fig. 1 (d,f), respectively. In order to understand such difference, we calculate the Pearson correlation coefficient between k and x as
where 〈x〉 and σ_{x} denote the average and standard deviation of x. We also obtain the characteristic assortativity for each characteristic x, adopted from^{12}:
where x_{l} and denote characteristics of nodes of the lth link, with and L is the total number of links in the network. The value of r_{xx} ranges from −1 to 1 and it increases according to the tendency of high characteristic nodes to be connected to other high characteristic nodes. The values of these quantities are summarized in Table I. From now on, we denote the degree assortativity as r_{kk}.
The kdependent behavior of h(k, x) can be understood mainly as the combined effect of r_{kk} and ρ_{kx}. Since r_{kk} ≈ 0.47 in the PR network, for a node i with fixed x_{i}, the larger k_{i} implies the larger k_{j} of its friend j. This may lead to the higher x_{j}, e.g., due to ρ_{kx} ≈ 0.79 for the number of publications, leading to the increasing behavior of h(k, x). However, for the average number of citations per publication showing ρ_{kx} ≈ 0.07, the larger k_{j} does not imply the higher x_{j}, which leads to the constant behavior of h(k, x). For the number of citations in the GS network, the almost neutral degree correlation by r_{kk} ≈ −0.02 inhibits any correlated behavior between characteristics, thus we again observe the constant behavior of h(k, x). We note that the neutral degree correlation in the GS network is unlike many other coauthorship networks, mainly due to incomplete information available from GS profiles and due to the snowball sampling method we employed^{26}.
Now we define the average paradox holding probability as , where P(k, x) denotes the probability distribution function of node with degree k and characteristic x. As shown in Table I, the value of H is larger than 0.7 for every considered characteristic, implying that the GFP holds at the individual level to a large extent.
(ii) Network level
In order to investigate the GFP at the network level, we define the average characteristic of neighbors 〈x〉_{nn} for comparing it to the average characteristic 〈x〉:
Here a node i with degree k_{i} has been considered as a neighbor k_{i} times. The GFP holds at the network level if the following condition is satisfied:
Note that setting x_{i} = k_{i} reduces the GFP to the FP. As shown in Table I, the GFP holds for all characteristics considered. In other words, your coauthors have on average more coauthors, more citations and more publications than you have.
In summary, our results indicate that the generalized friendship paradox holds at both individual and network levels for many node characteristics of networks.
Origin of the GFP
The prevalence of the GFP for most nodes in networks regardless of node characteristics implies that there might be a universal origin of the GFP. For the original friendship paradox, the existence of hub nodes and the variance of degree have been suggested for the origin of the paradox^{14}. In order to investigate the origin of the GFP at the network level, we define a function F = 〈x〉_{nn} − 〈x〉 and straightforwardly obtain the following equation:
One can say that the GFP holds if F > 0. Since standard deviations σ_{k} and σ_{x} are positive in any nontrivial cases, the GFP holds if ρ_{kx} > 0. Thus the degreecharacteristic correlation ρ_{kx} is the key element for the generalized friendship paradox. Note that in case when x_{i} = k_{i}, i.e., ρ_{kk} = 1, the FP holds in any nontrivial cases.
The origin of the GFP can help us to better understand the dynamical processes on networks when the characteristic x is considered to be a node activity such as communication frequency or traffic. The positive correlation between degree and node activity has been observed in mobile phone call patterns^{27} and the airtransportation network^{28}, enabling the application of the GFP to those phenomena. In case of protein interaction networks, the degrees of proteins are positively correlated with their lethality^{29,30}, while they are negatively correlated with their rates of evolution^{31}. The negative degreecharacteristic correlations, i.e., ρ_{kx} < 0, can lead to the opposite behavior of the GFP, which can be called antiGFP.
Sampling high characteristic nodes using GFP in complex networks
Identifying important or central nodes in a network is crucial for understanding the structure of complex networks and dynamical processes on those networks. The recent advance of informationcommunication technology (ICT) has opened up access to the data on largescale social networks. However, complete mapping of social networks is not feasible, partially due to privacy issues. Thus it is still important to devise proper sampling methods that exploit local network structure. In this sense, the original friendship paradox has been used to sample high degree nodes in empirical networks. It was found that the set of neighbors of randomly chosen nodes can have the predictive power of epidemic spreading on both offline social networks^{18} and online social networks^{19}.
We suggest two simple sampling methods using the GFP to identify high characteristic nodes in a network: (i) Friend sampling and (ii) biased sampling. These methods are then compared to the random sampling method to test whether our methods are more efficient to sample high characteristic nodes. We first choose random nodes to make a control group. For each node in the control group, one of its neighbors is randomly chosen. These chosen nodes compose a friend group. Finally, for each node in the control group, we choose its neighbor having the highest characteristic to make a biased group. For the biased sampling, we have assumed that each node has the full information about characteristics of its neighbors.
Figure 2 shows the characteristic distributions of sampled nodes from PR and GS networks by different sampling methods. Heavier tails of distributions imply better sampling for identifying high characteristic nodes. The performance of biased sampling is the best in all cases because this sampling utilizes more information about neighbors than the friend sampling. The friend sampling shows better performance than the random sampling (control group) for most characteristics as it is expected by large values of ρ_{kx}. One exceptional case is for the average number of citations per publication in the PR network, shown in Fig. 2 (d). Here the friend sampling does not better than the random sampling due to the very small degreecharacteristic correlation, ρ_{kx} ≈ 0.07, while the result by biased sampling is still better than those by other sampling methods.
Next, in order to investigate the effect of degreecharacteristic correlation on the performance of sampling methods, we consider an auxiliary characteristic X based on the method of Cholesky decomposition^{32}. To each node i with degree k_{i} in the PR network, we assign a characteristic X_{i} given by
where y_{i} denotes the ith element of the shuffled set of {k_{i}}. Since ρ = ρ_{kX} (See Method Section), the correlation can be easily controlled by ρ. Then we apply the same sampling methods to identify nodes with high X and compare their performances for different values of ρ_{kX}. Figure 3 shows that the biased sampling performs significantly better than any other sampling methods, independent of ρ_{kX}. The friend sampling performs better than the random sampling, while the difference in performance increases with the value of ρ_{kX}.
The sampling results suggest that the biased sampling can be very efficient and effective to detect a group of high characteristic nodes when the information about characteristics of neighbors is available. Otherwise the friend sampling still performs better than the random sampling.
Discussion
Node characteristics have profound influence on the evolution of networks^{23,24} and dynamical processes on such networks like spreading^{18,19,25}. By taking into account various node characteristics, we have generalized the friendship paradox in complex networks. The generalized friendship paradox (GFP) states that your friends have on average higher characteristics than you have. By analyzing two coauthorship networks of Physical Review (PR) journals and of Google Scholar (GS) profiles, we have found that the GFP holds at both individual and network levels for various node characteristics, such as the number of coauthors, the number of citations, the number of publications and the average number of citations per publication. It is also shown that the origin of the GFP at the network level is rooted in the positive correlation between degree and characteristic. Thus the GFP is expected to hold for any characteristic showing the positive correlation with degree. Here the characteristic can be also purely topological like various node centralities as they show significant positive correlations with degree, such as PageRank^{33}.
Despite the access to the data on largescale social networks, complete mapping of social networks is not feasible. Thus it is still important to devise effective and efficient sampling methods that exploit local network structure. We have suggested two simple sampling methods for identifying high characteristic nodes using the GFP. It is empirically found that a control group of randomly chosen nodes has the smaller number of high characteristic nodes than a friend group that consists of random neighbors of nodes in the control group. Moreover, provided that nodes have full information about characteristics of their neighbors, a biased group of the highest characteristic neighbors of nodes in the control group has the largest number of high characteristic nodes than other groups. This turns out to be the case even when the degreecharacteristic correlation is negligible.
Our sampling methods propose an explanation about how our perception can be affected by our friends. People's perception of the world and themselves depends on the status of their friends, colleagues and peers^{17}. When we compare our characteristics like popularity, income, reputation, or happiness to those of our friends, our perception of ourselves might be distorted as expected by the GFP. Comparing to the average friend, i.e., the friend sampling, is biased due to the positive degreecharacteristic correlation. Furthermore, comparing to the “better” friend, i.e., the biased sampling, is much more biased towards the “worse” perception of ourselves. This might be the reason why active online social networking service users are not happy^{34}, in which it is much easier to compare to other people in online social media.
Another interesting application of the GFP can be found in multiplex networks^{35,36}. If degrees of one layer are positively correlated with those of other layers, our sampling methods can be used to identify high degree nodes in other layers. Indeed, the degrees of each node are positively correlated across layers in a player network of an online game^{37} and in a multiplex transportation network^{38}.
Nodes are not only embedded in the topological structure, but they also have many other characteristics relevant to the structure and evolution of complex networks. However, the role of these nontopological characteristics is far from being fully understood. Our work on the generalized friendship paradox will help us consider the interplay between network structure and node characteristics for deeper understanding of complex networks.
Methods
Data description
We describe how the data for coauthorship networks have been collected and prepared. For the Physical Review (PR) network, the bibliographic data containing all papers published in Physical Review journals from 1893 to 2009 was downloaded from American Physical Society. The number of papers is 463348 and each paper has the title, the list of authors, the date of publication and citation information. By using author identification algorithm proposed by^{39}, we identified each author by his/her last name and initials of first and middle names if available. The number of identified authors is 242592. Combined with the numbers of citations and the list of authors of papers, we obtained for each author the number of coauthors, the number of citations, the number of publications and the average number of citations per publication.
Google Scholar (GS) service (scholar.google.com) provides profiles of academic authors. Each profile of the author contains information of the total number of citations and coauthor list of the author. Using snowball sampling^{26} starting from “AlbertLászló Barabási” (one of the leading network scientists), the coauthor relations and their citation information are collected. The number of authors in the dataset is 29968. Here we note that not all scientists have profile in the GS and not all coauthor relations are accessible.
Generating random node characteristics of arbitrary correlation with degree
Consider two independent random variables Y = (y_{1}, y_{2}, …, y_{N}) and Z = (z_{1}, z_{2}, …, z_{N}) with the same standard deviation, i.e., σ_{Y} = σ_{Z}. We generate a random sequence X = (x_{1}, x_{2}, …, x_{N}) from the following equation:
The correlation ρ_{XY} between X and Y is given by
where E(X) denotes the expectation of X. Using the independence of Y and Z, i.e., E(YZ) = E(Y)E(Z), we get
Then, from , we obtain σ_{X} = σ_{Y}, leading to
References
Watts, D. J. & Strogatz, S. H. Collective dynamics of ‘smallworld’ networks. Nature 393, 440–442 (1998).
Castello, C., Fortunato, S. & Loreto, V. Statistical physics of social dynamics. Rev. Mod. Phys. 81, 591–646 (2009).
Lazer, D. et al. Computational social science. Science 323, 721–723 (2009).
Vespignani, A. Modelling dynamical processes in complex sociotechnical systems. Nat. Phy. 8, 32–39 (2011).
Centola, D. The spread of behavior in an online social network experiment. Science 329, 1194–1197 (2010).
Bakshy, E., Rosenn, I., Marlow, C. & Adamic, L. The role of social networks in information diffusion. In: WWW' 12: Proc. 21st Intl. Conf. on World Wide Web Lyon, France. New York, NY, USA: ACM. (2012 April 16–20).
Christakis, N. A. & Fowler, J. H. The spread of obesity in a large social network over 32 years. N. Engl. J. Med. 357, 370 (2007).
PastorSatorras, R. & Vespignani, A. Epidemic spreading in scalefree networks. Phys. Rev. Lett. 86, 3200–3203 (2001).
Weng, L., Menczer, F. & Ahn, Y.Y. Virality prediction and community structure in social networks. Sci. Rep 3, 2522 (2013).
Marvel, S. A., Martin, T., Doering, C. R., Lusseau, D. & Newman, M. E. J. The smallworld effect is a modern phenomenon. arXiv:1310.2636 (2013).
Barabási, A.L. & Albert, R. Emergence of scaling in random networks. Science 286, 509–512 (1998).
Newman, M. E. J. Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002).
Fortunato, S. Community detection in graphs. Phys. Rep. 486, 75–174 (2010).
Feld, S. L. Why Your Friends Have More Friends Than Yo Do. Am. J. of Sociol. 96, 1464–1477 (1991).
Ugander, J., Karrer, B., Backstrom, L. & Marlow, C. The anatomy of the Facebook social graph. arXiv:1111.4503 (2011).
Hodas, N. O., Kooti, F. & Lerman, K. Friendship paradox redux: Your friends are more interesting than you. In: ICWSM' 13: Proc 7th Int. AAAI Conf. on Weblogs and Social Media, Cambridge, MA, USA. Palo Alto, CA, USA: The AAAI press (2013 July 8–10).
Zuckerman, E. & Jost, J. What makes you think you're so popular? Selfevaluation maintenance and the subjective side of the “friendship paradox”. Soc. Psychol. Q. 64, 207–223 (2001).
Christakis, N. A. & Fowler, J. H. Social network sensors for early detection of contagious outbreaks. PLoS ONE 5, e12948 (2010).
GarciaHerranz, M., Moro, E., Cerbrian, M., Christakis, N. A. & Fowler, J. H. Using friends as sensors to detect globalscale contagious outbreaks. arXiv:1211.6512 (2012).
Cohen, R., Havlin, S. & benAvraham, D. Efficient immunization strategies for computer networks and populations. Phys. Rev. Lett. 91, 247901 (2003).
Park, J. & Barabási, A.L. Distribution of node characteristics in complex networks. Proc. Natl. Acad. Sci. USA 104, 17916–17920 (2007).
Fowler, J. H., Dawes, C. T. & Christakis, N. A. Model of genetic variation in human social networks. Proc. Natl. Acad. Sci. USA 106, 1720–1724 (2008).
Kong, J. S., Sarshar, N. & Roychowdhury, V. P. Experience versus talent shapes the structure of the Web. Proc. Natl. Acad. Sci. USA 105, 13724–13729 (2008).
Eom, Y.H. & Fortunato, S. Characterizing and modeling citation dynamics. PLoS ONE 6, e24926 (2011).
Aral, S., Muchnik, L. & Sundararajan, A. Distinguishing influencebased contagion from homophilydriven diffusion in dynamic networks. Proc. Natl. Acad. Sci. USA 106, 21544–21549 (2009).
Lee, S. H., Kim, P.J. & Jeong, H. Statistical properties of sampled networks. Phys. Rev. E 73, 016102 (2006).
Onnela, J. et al. Analysis of a largescale weighted network of onetoone human communication. New J. Phys. 9, 179 (2007).
Barrat, A., Barthelemy, M., PastorSatorras, R. & Vespignani, A. The architecture of complex weighted networks. Proc. Natl. Acad. Sci. USA 101, 3747–3752 (2004).
Jeong, H., Mason, S. P., Barabási, A.L. & Oltvai, Z. N. Lethality and centrality in protein networks. Nature 411, 41–42 (2001).
Zotenko, E., Mestre, J., O'Leary, D. P. & Przytycka, T. M. Why do hubs in the Yeast protein interaction network tend to be essential: Reexamining the connection between the network topology and essentiality. PLoS Comput. Biol. 4, e1000140 (2008).
Fraser, H. B., Hirsh, A. E., Steinmetz, L. M., Scharfe, C. & Feldman, M. W. Evolutionary rate in the protein interactionnetwork. Science 296, 750–752 (2002).
Press, W. H., Teukolsky, S. A., Vetterling, W. T. & Flannery, B. P. Numerical Recipes in C: The Art of Scientific Computing  Second Edition. (Cambridge University Press, Cambridge 1992).
Fortunato, S., Bogunña, M., Flammini, A. & Menczer, F. [Approximating PageRank from indegree] Algorithms and Models for the WebGraph [59–71] (Springer Berlin Heidelberg, Germany, 2008).
Kross, E. et al. Facebook Use Predicts Declines in Subjective WellBeing in Young Adults. PLoS ONE 8, e69841 (2013).
Kivelä, M. et al. Multilayer networks. arXiv:1309.7233 (2013).
Jo, H.H., Baek, S. K. & Moon, H.T. Immunization dynamics on a twolayer network model. Physica A 361, 534–542 (2006).
Szell, M., Lambiotte, R. & Thurner, S. Multirelational organization of largescale social networks in an online world. Proc. Natl Acad. Sci. USA 107, 13636 (2010).
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C. & Havlin, S. Intersimilarity between coupled networks. Europhys. Lett. 92, 68002 (2010).
Radichhi, F., Fortunato, S., Markines, B. & Vespignani, A. Diffusion of scientific credits and the ranking of scientists. Phys. Rev. E 80, 056103 (2009).
Acknowledgements
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.
Author information
Authors and Affiliations
Contributions
Y.H.E. and H.H.J. designed research, wrote, reviewed and approved the manuscript. Y.H.E. performed data collection and analysis.
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Rights and permissions
This work is licensed under a Creative Commons AttributionNonCommercialShareAlike 3.0 Unported license. The images in this article are included in the article's Creative Commons license, unless indicated otherwise in the image credit; if the image is not included under the Creative Commons license, users will need to obtain permission from the license holder in order to reproduce the image. To view a copy of this license, visit http://creativecommons.org/licenses/byncsa/3.0/
About this article
Cite this article
Eom, YH., Jo, HH. Generalized friendship paradox in complex networks: The case of scientific collaboration. Sci Rep 4, 4603 (2014). https://doi.org/10.1038/srep04603
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/srep04603
This article is cited by

Nodebased generalized friendship paradox fails
Scientific Reports (2023)

The enmity paradox
Scientific Reports (2023)

The magic of networks grown by redirection
Indian Journal of Physics (2023)

Friendship paradox in growth networks: analytical and empirical analysis
Applied Network Science (2021)

Friendship paradox biases perceptions in directed networks
Nature Communications (2020)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.