Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Competition Between Homophily and Information Entropy Maximization in Social Networks (1411.3084v1)

Published 12 Nov 2014 in cs.SI and physics.soc-ph

Abstract: In social networks, it is conventionally thought that two individuals with more overlapped friends tend to establish a new friendship, which could be stated as homophily breeding new connections. While the recent hypothesis of maximum information entropy is presented as the possible origin of effective navigation in small-world networks. We find there exists a competition between information entropy maximization and homophily in local structure through both theoretical and experimental analysis. This competition means that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We conjecture that in the evolution of the social network, both of the two assumptions coexist. The rule of maximum information entropy produces weak ties in the network, while the law of homophily makes the network highly clustered locally and the individuals would obtain strong and trust ties. Our findings shed light on the social network modeling from a new perspective.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Jichang Zhao (46 papers)
  2. Xiao Liang (132 papers)
  3. Ke Xu (309 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.