Software Tools to Quantify Structural Importance of Nodes in a Network
Provides functionality to compute various node centrality measures on networks.
Included are functions to compute betweenness centrality (by utilizing Madduri and Bader's
SNAP library), implementations of Burt's constraint and effective
network size (ENS) metrics, Borgatti's algorithm to identify key players, and Valente's
bridging metric. On Unix systems, the betweenness, Key Players, and
bridging implementations are parallelized with OpenMP, which may run
faster on systems which have OpenMP configured.
influenceR: Software tools to quantify structural importance of nodes in a network. Algorithms include Betweenness Centrality, Bridging, Constraint Index, Effective Network Size, and Key Players. Currently, algorithms are implemented only for undirected graphs; work on directed graphs is in progress.
The current release version can be found on CRAN and installed with:
If using this package, please cite Jacobs SD, Khanna AS (2015). influenceR: Software tools to quantify structural importance of nodes in a network R Package Version? URL?
Development of this software package was supported by NIH grant R01 DA033875.
Functions in influenceR
|csv.to.igraph||Convert a CSV file to an igraph graph object.|
|constraint||Burt's Constraint Index.|
|influenceR||influenceR: Software tools to quantify structural importance of nodes in a network.|
|bridging||Valente's Bridging vertex measure.|
|betweenness||Vertex Betweenness centrality measure.|
|ens||Burt's Effective Network Size and Constraint index. The next two functions below provide ways to measure the actors' access to structural holes in a network. Structural holes "provide opportunities to broker connections between people" (Burt 2008).|
|keyplayer||Compute a KPP-Pos set for a given graph.|
Last month downloads
|Packaged||2015-09-02 16:20:53 UTC; sdjacobs|
Include our badge in your README