The influenceR package includes functions to quantify the structural importance of nodes in a network. Algorithms include Betweenness Centrality, Bridging, Constraint Index, Effective Network Size, and Key Players. Currently, algorithms are only guaranteed to work on undirected graphs; work on directed graphs is in progress. These functions run on graph objects from the igraph package.
In addition to igraph, this package makes use of the SNAP framework for a high-performance graph data structure and an OpenMP-parallelized implementation of Betweenness Centrality. See http://snap-graph.sourceforge.net
Development of this software package was supported by NIH grant R01 DA033875.
The website and source code is located at http://github.com/rcc-uchicago/influenceR.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.