Skip to main content

Measuring the Generalized Friendship Paradox in Networks with Quality-Dependent Connectivity

  • Conference paper
Complex Networks VI

Part of the book series: Studies in Computational Intelligence ((SCI,volume 597))

Abstract

The friendship paradox is a sociological phenomenon stating that most people have fewer friends than their friends do. The generalized friendship paradox refers to the same observation for attributes other than degree, and it has been observed in Twitter and scientific collaboration networks. This paper takes an analytical approach to model this phenomenon. We consider a preferential attachment-like network growth mechanism governed by both node degrees and ‘qualities’. We introduce measures to quantify paradoxes, and contrast the results obtained in our model to those obtained for an uncorrelated network, where the degrees and qualities of adjacent nodes are uncorrelated. We shed light on the effect of the distribution of node qualities on the friendship paradox. We consider both the mean and the median to measure paradoxes, and compare the results obtained by using these two statistics.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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–1477 (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. Hodas, N.O., Kooti, F., Lerman, K.: Friendship Paradox Redux: Your Friends Are More Interesting Than You. In: Proc. 7th Int. Conf. on Weblogs and Social Media, ICWSM 2013, pp. 1–8. ACM, New York (2013)

    Google Scholar 

  4. Ugandre, J., Karrer, B., Backstorm, L., Marlow, C.: The Anatomy of the Facebook Social Graph. arXiv preprint arxiv:1111.4503 (2011)

    Google Scholar 

  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. Jo, H.H., Eom, Y.H.: Generalized Friendship Paradox in Networks with Tunable Degree-attribute Correlation. Physical Review E 90(2) (2014)

    Google Scholar 

  7. Kooti, F., Hoda, N.O., Lerman, K.: Network Weirdness: Exploring the Origins of Network Paradoxes. In: Proc. 8th Int. Conf. on Weblogs and Social Media, ICWSM 2014, pp. 266–274 (2014)

    Google Scholar 

  8. Cohen, R., Havlin, S., Ben-Avraham, D.: Efficient Immunization Strategies for Computer Networks and Populations. Physical Review Letters 91(24), 247901 (2003)

    Article  Google Scholar 

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

  10. Kryvasheyeu, Y., Chen, H., Moro, E., Van Hentenryck, P., Cebrian, M.: Performance of Social Network Sensors During Hurricane Sandy. arXiv preprint arXiv:1402.2482 (2014)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Fotouhi, B., Momeni, N., Rabbat, M.G.: Generalized Friendship Paradox: An Analytical Approach. Appearing in Proc. 6th Int. Conf. on Social Informatics (workshops), SocInfo 2014, arXiv preprint arXiv:1410.0586 (2014)

    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

Momeni, N., Rabbat, M.G. (2015). Measuring the Generalized Friendship Paradox in Networks with Quality-Dependent Connectivity. In: Mangioni, G., Simini, F., Uzzo, S., Wang, D. (eds) Complex Networks VI. Studies in Computational Intelligence, vol 597. Springer, Cham. https://doi.org/10.1007/978-3-319-16112-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16112-9_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16111-2

  • Online ISBN: 978-3-319-16112-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics