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 suggests that a newly built relationship between two individuals with more common friends would lead to less information entropy gain for them. We demonstrate 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. A toy model is also presented to demonstrate the competition and evaluate the roles of different rules in the evolution of real networks. Our findings could shed light on the social network modeling from a new perspective.
Highlights
The last decade has witnessed tremendous research interests in complex networks [1,2,3], including the evolution of social networks [4,5,6,7,8]
A social network can be modeled as a simple undirected graph G(V, E), where V is the set of individuals and E is the set of friendships among them
Both theoretical analysis and experimental results show that the rule of homophily is competing with the law of information entropy maximization in social networks
Summary
The last decade has witnessed tremendous research interests in complex networks [1,2,3], including the evolution of social networks [4,5,6,7,8]. We denote the data set it generates as BA(N, m), where N is the size of the network and m is the number of initial ties that would be connected when a new node is added.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.