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.
|Author||Jacobs Simon [aut], Khanna Aditya [aut, cre], Madduri Kamesh [ctb], Bader David [ctb]|
|Date of publication||2015-09-03 12:20:15|
|Maintainer||Khanna Aditya <firstname.lastname@example.org>|
betweenness: Vertex Betweenness centrality measure.
bridging: Valente's Bridging vertex measure.
constraint: Burt's Constraint Index.
csv.to.igraph: Convert a CSV file to an igraph graph object.
ens: Burt's Effective Network Size and Constraint index. The next...
influenceR: influenceR: Software tools to quantify structural importance...
keyplayer: Compute a KPP-Pos set for a given graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.