Signed Graph Analysis for the Interpretation of Voting Behavior
arXiv:1712.10157
Abstract
In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to model polarized systems. Such a graph can be characterized through the notion of structural balance, which relies on the partitioning of the graph into internally solidary but mutually hostile subgroups. In this work, we show that signed graphs can be used to model and understand voting behavior. We take advantage of data from the European Parliament to confront two variants of structural balance, and illustrate how their use can help better understanding the studied system.
References in corpus (5)
- Community detection in graphs
- Comparing community structure identification
- Prediction and Clustering in Signed Networks: A Local to Global Perspective
- Mesoscopic analysis of online social networks - The role of negative ties
- Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament