Mesoscopic analysis of online social networks - The role of negative ties

Abstract

A class of networks are those with both positive and negative links. In this manuscript, we studied the interplay between positive and negative ties on mesoscopic level of these networks, i.e., their community structure. A community is considered as a tightly interconnected group of actors; therefore, it does not borrow any assumption from balance theory and merely uses the well-known assumption in the community detection literature. We found that if one detects the communities based on only positive relations (by ignoring the negative ones), the majority of negative relations are already placed between the communities. In other words, negative ties do not have a major role in detecting communities of studied signed networks. Moreover, regarding the internal negative ties, we proved that most unbalanced communities are maximally balanced, and hence they cannot be partitioned into k nonempty sub-clusters with higher balancedness (k >= 2). Furthermore, we showed that although the mediator triad ++- (hostile-mediator-hostile) is underrepresented, it constitutes a considerable portion of triadic relations among communities. Hence, mediator triads should not be ignored by community detection and clustering algorithms. As a result, if one uses a clustering algorithm that operates merely based on social balance, mesoscopic structure of signed networks significantly remains hidden.

13 pages, 8 figures

References in corpus (9)

• Maps of random walks on complex networks reveal community structure
• Resolution limit in community detection
• Multirelational Organization of Large-scale Social Networks in an Online World
• Community detection in networks with positive and negative links
• Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
• Analysis of community structure in networks of correlated data
• Characterizing the community structure of complex networks
• Comparative Evaluation of Community Detection Algorithms: A Topological Approach
• Exploring the limits of community detection strategies in complex networks

Cited by in corpus (8)

• Glassy states of aging social networks
• Proper network randomization is key to assessing social balance
• Signed Graph Analysis for the Interpretation of Voting Behavior
• Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament
• Multi-Community Detection in Signed Graphs Using Quantum Hardware
• Who will accept my request? Predicting response of link initiation in two-way relation networks
• A modelling and computational study of the frustration index in signed networks
• The emergence of pseudo-stable states in network dynamics