SocNetV 1.5 "standardization"
Version 1.5 brought new features and many bugfixes. See ChangeLog (http://
Milestone information
- Project:
- SocNetV
- Series:
- 1.x
- Version:
- 1.5
- Code name:
- standardization
- Released:
- Registrant:
- Dimitris Kalamaras
- Release registered:
- Active:
- No. Drivers cannot target bugs and blueprints to this milestone.
Activities
- Assigned to you:
- No blueprints or bugs assigned to you.
- Assignees:
- 19 Dimitris Kalamaras
- Blueprints:
- 4 Implemented
- Bugs:
- 15 Fix Released
Download files for this release
Release notes
Version 1.5 brings new features and bugfixes.
Among the new features are :
* Prominence indices on valued networks
A new SSSP-solver algorithm has been implemented (Dijkstra)
which allows SocNetV to compute prominence indices on weighted
networks. When the graph edges are weighted, the application
asks the user if it should consider weights in computations.
Also, it asks the user if weights should be inverted or not.
This question is crucial since edge weights can have
different meanings. For instance they can denote cost or votes.
If they denote cost, then the geodesics should be those paths
with minimum value. But, if the weights denote votes, then the
geodesics could be those path with maximum value. In the latter
case, the user should choose to invert weights so that Dijkstra
compute the desired paths and distances.
* Standardized Centrality and Prestige scores
From this version all actor prominence indices report standardized
scores (from 0.0 to 1.0) where applicable. If there is no known
formula to compute such a standardized score for actors, then
SocNetV computes a std score by dividing the original index score
by the sum of index scores of all actors. For instance, this happens
on PRP. Warning: If the original prominence index has range
from 0 to 1 (i.e. EC and IRCC), SocNetV considers that as std and
does not compute anything else.
* Work without isolates, if you like
The user can omit isolates and compute prominence indices
for the resulting graph.
* Graph connectedness
SocNetV can report the network connectedness (whether it is a
connected graph or digraph, unilateral etc). Also it can check
whether isolates exist that can be removed so that the graph
can become connected
* CC drops isolates by default
Up to v1.5, SocNetV did not compute CC scores if the network had
isolate nodes, instead it urged the user to use IRCC. From this
version, SocNetV checks if isolates exists and automatically drops
them in order to compute CC scores.
For a complete list of changes and bugfixes, see the ChangeLog.
Changelog
4 blueprints and 15 bugs targeted
Blueprint | Priority | Assignee | Delivery | |
---|---|---|---|---|
All prominence indices should report variance and mean | All prominence indices should report variance and mean | 5 Essential | Dimitris Kalamaras | 11 Implemented |
SocNetV should allow, read, edit and save node and edge colors in RGB format | SocNetV should allow, read, edit and save node and edge colors in RGB format | 4 High | Dimitris Kalamaras | 11 Implemented |
Support multiple relations declared in a Pajek formatted file | Support multiple relations declared in a Pajek formatted file | 4 High | Dimitris Kalamaras | 11 Implemented |
The user should be able to control if isolate nodes are considered | The user should be able to control if isolate nodes are considered | 3 Medium | Dimitris Kalamaras | 11 Implemented |