Signed Graph Analysis for the Interpretation of Voting Behavior - Archive ouverte HAL
Conference Papers Year : 2017

Signed Graph Analysis for the Interpretation of Voting Behavior

Nejat Arinik
Rosa Figueiredo
Vincent Labatut

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.
Fichier principal
Vignette du fichier
IWSNADH_arinik.pdf (2.25 Mo) Télécharger le fichier
presentation.pdf (6.28 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01583133 , version 1 (06-09-2017)
hal-01583133 , version 2 (21-12-2017)
hal-01583133 , version 3 (19-01-2018)

Licence

Identifiers

Cite

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⟩
601 View
322 Download

Altmetric

Share

More