Author:
Aref Samin,Neal Zachary P.
Abstract
AbstractIn network science, identifying optimal partitions of a signed network into internally cohesive and mutually divisive clusters based on generalized balance theory is computationally challenging. We reformulate and generalize two binary linear programming models that tackle this challenge, demonstrating their practicality by applying them to partition signed networks of collaboration and opposition in the US House of Representatives. These models guarantee a globally optimal network partition and can be practically applied to signed networks containing up to 30,000 edges. In the US House context, we find that a three-cluster partition is better than a conventional two-cluster partition, where the otherwise hidden third coalition is composed of highly effective legislators who are ideologically aligned with the majority party.
Funder
Max Planck Institute for Demographic Research
Publisher
Springer Science and Business Media LLC
Reference57 articles.
1. Iacono, G., Ramezani, F., Soranzo, N. & Altafini, C. Determining the distance to monotonicity of a biological network: A graph-theoretical approach. IET Syst. Biol. 4, 223–235 (2010).
2. Aref, S. & Wilson, M. C. Balance and frustration in signed networks. J. Complex Netw. 7, 163–189. https://doi.org/10.1093/comnet/cny015 (2019).
3. Tahmassebi, A. et al. Determining driver nodes in dynamic signed biological networks. In Smart Biomedical and Physiological Sensor Technology XVI Vol. 11020 (eds Cullum, B. M. et al.) 53–60 (International Society for Optics and Photonics (SPIE), 2019). https://doi.org/10.1117/12.2519550.
4. Souto, P. C., Teixeira, A. S., Francisco, A. P. & Santos, F. C. Capturing financial volatility through simple network measures. In International Conference on Complex Networks and Their Applications 534–546 (Springer, 2018).
5. Neal, Z. P. A sign of the times? Weak and strong polarization in the US Congress, 1973–2016. Soc. Netw. 60, 103–112 (2020).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献