Cargando…
Detecting coalitions by optimally partitioning signed networks of political collaboration
We propose new mathematical programming models for optimal partitioning of a signed graph into cohesive groups. To demonstrate the approach’s utility, we apply it to identify coalitions in US Congress since 1979 and examine the impact of polarized coalitions on the effectiveness of passing bills. Ou...
Autores principales: | Aref, Samin, Neal, Zachary |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6992702/ https://www.ncbi.nlm.nih.gov/pubmed/32001776 http://dx.doi.org/10.1038/s41598-020-58471-z |
Ejemplares similares
-
Identifying hidden coalitions in the US House of Representatives by optimally partitioning signed networks based on generalized balance
por: Aref, Samin, et al.
Publicado: (2021) -
Selfish partners: resource partitioning in male coalitions of Asiatic
lions
por: Chakrabarti, Stotra, et al.
Publicado: (2017) -
Coalitions and conflict: A longitudinal analysis of men's politics
por: Redhead, Daniel, et al.
Publicado: (2021) -
Multilevel structural evaluation of signed directed social networks based on balance theory
por: Aref, Samin, et al.
Publicado: (2020) -
Networking expertise: Discursive coalitions and collaborative networks of
experts in a public creationism controversy in the UK
por: Allgaier, Joachim
Publicado: (2012)