HackerPapers

arXiv:2412.02061cs.SI

Strong Friendship Paradox in Social Networks

Kristina Lerman

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

The friendship paradox in social networks states that your friends have more friends than you do, on average. Recently, a stronger variant of the paradox was shown to hold for most people within a network: `most of your friends have more friends than you do.' Unlike the original paradox, which arises trivially because a few very popular people appear in the social circles of many others and skew their average friend popularity, the strong friendship paradox depends on features of higher-order network structures. Similar to the original paradox, the strong friendship paradox generalizes beyond popularity. When individuals have traits, many will observe that most of their friends have more of that trait than they do. This can lead to the Majority illusion, in which a rare trait will appear highly prevalent within a network. Understanding how the strong friendship paradox biases local observations within networks can inform better measurements of network structure and our understanding of collective phenomena in networks.

arXiv comments
Please cite as: Kristina Lerman (2025). Strong Friendship Paradox in Social Networks. In: T. Yasseri (Ed.), Handbook of Computational Social Science. Edward Elgar Publishing Ltd
Journal reference
DOI
Subjects
cs.SISocial and Information Networks

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Dec 2024 to Dec 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.