Signed Graph Analysis for the Interpretation of Voting Behavior

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01583133
Contributor : Vincent Labatut <>
Submitted on : Friday, January 19, 2018 - 4:17:49 PM
Last modification on : Monday, July 1, 2019 - 11:38:06 AM

Files

IWSNADH_arinik.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - ShareAlike 4.0 International License

Identifiers

  • HAL Id : hal-01583133, version 3
  • ARXIV : 1712.10157

Collections

Citation

Nejat Arinik, Rosa Figueiredo, Vincent Labatut. Signed Graph Analysis for the Interpretation of Voting Behavior. International Conference on Knowledge Technologies and Data-driven Business (i-KNOW), Oct 2017, Graz, Austria. ⟨hal-01583133v3⟩

Share

Metrics

Record views

455

Files downloads

57