Computing
node centralities Milenkovic Lab 





Computing node centralities 

Contact:
Introduction: A node centrality measure computes the topological importance of a node in the network (or graph). Various centrality measures have been used to link topological importance of nodes in the network to its functional importance. With this motivation, we study topologies of nodes in networks using the following seven stateoftheart node centrality measures in our dynamic network analysis paper.
Below we provide the implementation of the seven node centrality measures from our following paper. Reference: Fazle E. Faisal and Tijana Milenkovic (2014), Dynamic networks reveal key players in aging, Bioinformatics, 30(12):17211729. Software: The Unix version implementation for computing node centralities is available here. Usage: ./nodecentrality.sh [input_network] [input_network_format] [node_centrality_measure] [output_directory]
Example: ./nodecentrality.sh sample_network/sample.txt E A sample_output
Please cite our our paper if you use the software.

