[Networkit] centralization index

Christian Staudt christian.staudt at kit.edu
Fri Sep 11 13:08:39 CEST 2015


Hi developers working on node centrality algorithms,
please note and extend your implementations:

The centralization index [1] quantifies how centralized a given network is. More precisely, it is a measure of how central its most central node is in relation to how central all the other nodes are. The formula for calculating this is now implemented as the Centrality.centralization() method of the Centrality base class. It calls the Centrality.maximum method which needs to be implemented separately for each centrality measure. All node centrality algorithms should inherit from the Centrality base class and implement Centrality.maximum, which must return the theoretical maximum centrality score in a network with n nodes and arbitrary edges.
For some that may be a star-shaped graph, for others a complete graph, etc.… depending on the definition of the centrality measure.

Best,
Chris


[1]: https://en.wikipedia.org/wiki/Centrality#Freeman_Centralization
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20150911/340e36d6/attachment.sig>


More information about the NetworKit mailing list