Skip to main content

Generalized Friendship Paradox: An Analytical Approach

  • Conference paper
  • First Online:
Social Informatics (SocInfo 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8852))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feld, S.L.: Why Your Friends Have More Friends than You Do. American Journal of Sociology 96(6), 1464–77 (1991)

    Article  Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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

  5. Eom, Y.H., Jo, H.H.: Generalized Friendship Paradox in Complex Networks: The Case of Scientific Collaboration, Nature Scientific Reports, 4 (2014)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  8. Bianconi, G., Barabási, A.L.: Competition and Multiscaling in Evolving Networks. Europhysics Lettres 54(4), 436–442 (2001)

    Article  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. Smolyarenko, I.E., Hoppe, K., Rodgers, G.J.: Network Growth Model with Intrinsic Vertex Fitness. Physical Review E 88(1), 012805 (2013)

    Article  Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. Fotouhi, B., Rabbat, M.G.: Degree Correlation in Scale-free Graphs. European Physical Journal B, 86(12) (2013)

    Google Scholar 

  14. Krapivsky, P.L., Redner, S.: Organization of Growing Random Networks. Physical Review E 63(6), 066123 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Naghmeh Momeni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics