Revisiting The Felds Friendship Paradox In Online Social Networks

IEEE ACCESS(2020)

引用 0|浏览20
暂无评分
摘要
Feld & x2019;s friendship paradox is a widely accepted observation that states that the friends of any particular individual tend to have more friends on average than the individual has. Due to its implications for information transmission, the friendship paradox has become a generalized paradigm in many disciplines. However, how many of an individual & x2019;s friends have more friends than the individual does is still unknown, yet interesting. In this paper, we revisited the Feld & x2019;s friendship paradox and we found that only a limited number of a person & x2019;s friends have more friends than the person herself has. This conclusion was reached from empirical studies using real-world networks and is true regardless of the number of one & x2019;s neighbours, which contradicts the intuitive deduction from the friendship paradox. For one thing, if a person is unpopular, the number of her friends that have more friends than she does grows with the number of friends that she makes. This observation crystallizes the tenable margin of the friendship paradox. In another case, if a person is popular, as she acquires more friends, fewer of her friends have more friends than she does. This finding suggests an observation bias in the friendship paradox, which makes individuals feel less popular than their friends. Besides enriching our knowledge of the friendship paradox in psychological science, the findings reported here are also beneficial for technical areas such as large-scale triangle discovery. Although the friendship paradox was proposed from the perspective of the number of neighbours, the findings reported here can shed light on theories and applications from different disciplines like information, happiness, obesity, and extroversion, to name a few.
更多
查看译文
关键词
Computer science, Feld's friendship paradox, social computing, social network
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要