Multiple partitioning of multiplex signed networks: Application to European parliament votes

Abstract : For more than a decade, graphs have been used to model the voting behavior taking place in parliaments. However, the methods described in the literature suffer from several limitations. The two main ones are that 1) they rely on some temporal integration of the raw data, which causes some information loss; and/or 2) they identify groups of antagonistic voters, but not the context associated to their occurrence. In this article, we propose a novel method taking advantage of multiplex signed graphs to solve both these issues. It consists in first partitioning separately each layer, before grouping these partitions by similarity. We show the interest of our approach by applying it to a European Parliament dataset.
Complete list of metadatas

Cited literature [81 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02082574
Contributor : Nejat Arinik <>
Submitted on : Thursday, March 28, 2019 - 12:24:34 PM
Last modification on : Monday, July 1, 2019 - 11:38:10 AM
Long-term archiving on : Saturday, June 29, 2019 - 2:09:51 PM

File

Multiple_partitioning_of_multi...
Files produced by the author(s)

Identifiers

Collections

Citation

Nejat Arinik, Rosa Figueiredo, Vincent Labatut. Multiple partitioning of multiplex signed networks: Application to European parliament votes. Social Networks, Elsevier, In press, ⟨10.1016/j.socnet.2019.02.001⟩. ⟨hal-02082574⟩

Share

Metrics

Record views

28

Files downloads

37