Based on the word-famous Fruchterman-Reingold algorithm for network visualization, this (naive) adaptation for signed networks considers attractive forces for positive edges and repulsive forces for negative edges. This approach helps visualize the structural relationships and tensions within the network, highlighting both cohesion and division among communities.
Clone this repository with the command
git clone https://github.com/elenacandellone/signed-spring-layout.git
Run the notebook viz.ipynb.
Fruchterman, T. M., & Reingold, E. M. (1991). Graph drawing by force‐directed placement. Software: Practice and experience, 21(11), 1129-1164.
- Elena Candellone e.candellone@uu.nl