Abstract
The friendship paradox refers to the sociological observation that, while the people’s assessment of their own popularity is typically self-aggrandizing, in reality they are less popular than their friends. The generalized friendship paradox is the average alter superiority observed empirically in social settings, scientific collaboration networks, as well as online social media. We posit a quality-based network growth model in which the chance for a node to receive new links depends both on its degree and a quality parameter. Nodes are assigned qualities the first time they join the network, and these do not change over time. We analyse the model theoretically, finding expressions for the joint degree-quality distribution and nearest-neighbor distribution. We then demonstrate that this model exhibits both the friendship paradox and the generalized friendship paradox at the network level, regardless of the distribution of qualities. We also show that, in the proposed model, the degree and quality of each node are positively correlated regardless of how node qualities are distributed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feld, S.L.: Why Your Friends Have More Friends than You Do. American Journal of Sociology 96(6), 1464–77 (1991)
Ezar, W., Zuckerman, J.T.: What Makes You Think You’re So Popular? Self-evaluation Maintenance and the Subjective Side of the “Friendship Paradox”. Social Psychology Quarterly 64(3), 207–223 (2001)
Gracia-Herranz, M., Moro, E., Cebrian, M., Christakis, N., Fowler, J.: Using Friends as Sensors to Detect Global-Scale Contagious Outbreaks. PLos ONE 9, e92413 (2014)
Kryvasheyeu, Y., Chen, H., Moro, E., Van Hentenryck, P., Cebrian, M.: Performance of Social Network Sensors During Hurricane Sandy (2014). arXiv preprint arXiv:1402.2482
Eom, Y.H., Jo, H.H.: Generalized Friendship Paradox in Complex Networks: The Case of Scientific Collaboration, Nature Scientific Reports, 4 (2014)
Hodas, N.O., Kooti, F., Lerman, K.: Friendship paradox redux: your friends are more interesting than you. In: 7th International AAAI Conference on Weblogs and Social Media, pp. 225–233 (2013)
Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Bianconi, G., Barabási, A.L.: Competition and Multiscaling in Evolving Networks. Europhysics Lettres 54(4), 436–442 (2001)
Caldarelli, G., Capocci, A., de Los Rios, P., Muñoz, M.A.: Scale-free Networks from Varying Vertex Intrinsic Fitness. Physical Review Letters 89(25), 258702 (2002)
Servedio, V.T.P., Caldarelli, G., Butta, P.: Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-free Networks. Physical Review E 70(5), 056126 (2004)
Smolyarenko, I.E., Hoppe, K., Rodgers, G.J.: Network Growth Model with Intrinsic Vertex Fitness. Physical Review E 88(1), 012805 (2013)
Dorogovtsev, S.N., Mendes, J.F.F., Samukhin, A.N.: Structure of Growing Networks with Preferential Linking. Physical Review Letters 85(21), 4633–4436 (2000)
Fotouhi, B., Rabbat, M.G.: Degree Correlation in Scale-free Graphs. European Physical Journal B, 86(12) (2013)
Krapivsky, P.L., Redner, S.: Organization of Growing Random Networks. Physical Review E 63(6), 066123 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fotouhi, B., Momeni, N., Rabbat, M.G. (2015). Generalized Friendship Paradox: An Analytical Approach. In: Aiello, L., McFarland, D. (eds) Social Informatics. SocInfo 2014. Lecture Notes in Computer Science(), vol 8852. Springer, Cham. https://doi.org/10.1007/978-3-319-15168-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-319-15168-7_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15167-0
Online ISBN: 978-3-319-15168-7
eBook Packages: Computer ScienceComputer Science (R0)