| Name | Modified | Size | Downloads / Week |
|---|---|---|---|
| Parent folder | |||
| SocNetV-3.8-windows-installer.exe | 2026-09-28 | 48.7 MB | |
| SocNetV-3.8-x86_64.AppImage | 2026-09-28 | 39.0 MB | |
| SocNetV-3.8.dmg | 2026-09-28 | 31.3 MB | |
| SocNetV-3.8-src.tar.gz | 2026-09-28 | 1.5 MB | |
| SocNetV-3.8-src.zip | 2026-09-28 | 1.9 MB | |
| README.md | 2026-09-28 | 1.3 kB | |
| SocNetV 3.8 source code.tar.gz | 2026-09-28 | 1.5 MB | |
| SocNetV 3.8 source code.zip | 2026-09-28 | 1.9 MB | |
| Totals: 8 Items | 125.7 MB | 0 | |
Highlights
- Signed network support: negative edge weights, negative-weight-safe shortest paths (Bellman-Ford/Johnson's algorithm), and two new signed-specific centrality measures — Signed Degree Centrality and PN Centrality.
- Faster on large networks: Degree Centrality, Clustering Coefficient, Triad Census, and several other measures now compute in parallel — up to ~6x faster on large graphs.
- Graph Connectivity now uses a much faster algorithm (Esfahanian-Hakimi) instead of an O(N²) pairwise sweep — networks that previously hung for 30+ minutes now complete in seconds.
Notable fixes
- Betweenness, Stress, and Eccentricity Centrality, diameter, and average distance could all be slightly wrong on weighted or disconnected networks in various edge cases — all corrected.
- Hierarchical clustering: fixed a bug where isolated vertices corrupted every merge, and added a true UPGMA linkage method (the existing "average-linkage" option was actually WPGMA).
- Similarity/Pearson reports no longer produce NaN on small networks.
- Fixed several memory leaks in
Matrixoperations. - DL and Adjacency format parsers no longer silently drop negative-weight edges on import.
Full Changelog: https://github.com/socnetv/app/compare/v3.7...v3.8