graphinius

graphinius copied to clipboard

The node strength is just the sum of the weights of all the adjacent edges (or DEFAULT if unweighted, which in case of DEFAULT==1 would just be the all_degree).

Reason: node strength and node betweenness centrality are connected, networkX documentation quote: "A study of the average value s(b) of the strength for vertices with betweenness b shows that the functional behavior can be approximated by a scaling form: s(b)\approx b^{{\alpha }}"

This could help in speeding up / approximating the betweenness via vectorized computations, thus executing the computations on a SIMD CPU or even GPU