# Signed Graph Analysis for the Interpretation of Voting Behavior

arXiv: https://arxiv.org/abs/1712.10157 · HTML: https://mlsanity.com/paper/1712.10157/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Dec 2017.

## Built on by (most cited first, 1 of 1)

- [Signed graphs in data sciences via communicability geometry](https://mlsanity.com/paper/2403.07493/) (2024)

## Abstract (arXiv)

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.