Skip to main content

Quantifying the Strength of the Friendship Paradox

  • Conference paper
  • First Online:
Complex Networks and Their Applications VII (COMPLEX NETWORKS 2018)

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

Included in the following conference series:

  • 2529 Accesses

Abstract

The friendship paradox is the observation that friends of individuals tend to have more friends or be more popular than the individuals themselves. In this work, we first develop local metrics that quantify the strength and the direction of the paradox from the perspective of individual nodes, i.e., is the individual more or less popular than its friends. We aggregate the local measures to define global metrics that capture the friendship paradox at the network scale. Theoretical results are shown that support the global metrics to be well-behaved enough to capture the friendship paradox. Furthermore, through experiments, we identify regimes in network models, and real networks, where the friendship paradox is prominent. By conducting a correlation study between the proposed metrics and assortativity, we experimentally demonstrate that the phenomenon of the friendship paradox is related to the well-known phenomenon of homophily or assortative mixing.

Research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-09-2-0053 (the ARL Network Science CTA). The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on. This document does not contain technology or technical data controlled under either the U.S. International Traffic in Arms Regulations or the U.S. Export Administration Regulations.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.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

References

  1. Bagrow, J.P., Danforth, C.M., Mitchell, L.: Which friends are more popular than you?: contact strength and the friendship paradox in social networks. In: Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 103–108. ACM (2017)

    Google Scholar 

  2. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  3. Bollen, J., Gonçalves, B., van de Leemput, I., Ruan, G.: The happiness paradox: your friends are happier than you. EPJ Data Sci. 6(1), 4 (2017)

    Article  Google Scholar 

  4. Eom, Y.H., Jo, H.H.: Generalized friendship paradox in complex networks: the case of scientific collaboration. Sci. Rep. 4, 4603 (2014)

    Article  Google Scholar 

  5. Erdos, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17–60 (1960)

    MathSciNet  MATH  Google Scholar 

  6. Feld, S.L.: Why your friends have more friends than you do. Am. J. Sociol. 96(6), 1464–1477 (1991)

    Article  Google Scholar 

  7. Fotouhi, B., Momeni, N., Rabbat, M.G.: Generalized friendship paradox: an analytical approach. In: International Conference on Social Informatics, pp. 339–352. Springer, Berlin (2014)

    Google Scholar 

  8. Hodas, N.O., Kooti, F., Lerman, K.: Friendship paradox redux: your friends are more interesting than you. Int. AAAI Conf. Weblogs and Soc. Media (ICWSM) 13, 8–10 (2013)

    Google Scholar 

  9. Jackson, M.O.: The friendship paradox and systematic biases in perceptions and social norms (2016). arXiv:1605.04470

  10. Kunegis, J.: KONECT: the Koblenz network collection (2013). http://konect.uni-koblenz.de/

  11. McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Annu. Rev. Sociol. 27(1), 415–444 (2001)

    Article  Google Scholar 

  12. Newman, M.E.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208,701 (2002)

    Article  Google Scholar 

  13. Piraveenan, M., Prokopenko, M., Zomaya, A.Y.: Classifying complex networks using unbiased local assortativity. In: Conference on Artificial Life, pp. 329–336 (2010)

    Google Scholar 

  14. Thedchanamoorthy, G., Piraveenan, M., Kasthuriratna, D., Senanayake, U.: Node assortativity in complex networks: an alternative approach. Procedia Comput. Sci. 29, 2449–2461 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yitzchak Novick .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 This is a U.S. government work and not under copyright protection in the U.S.; foreign copyright protection may apply

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pal, S., Yu, F., Novick, Y., Swami, A., Bar-Noy, A. (2019). Quantifying the Strength of the Friendship Paradox. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 813. Springer, Cham. https://doi.org/10.1007/978-3-030-05414-4_37

Download citation

Publish with us

Policies and ethics