influenceR

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 constraint and effective network size by Burt (2000) https://doi.org/10.1016%2FS0191-3085%2800%2922009-1; algorithm to identify key players by Borgatti (2006) https://doi.org/10.1007%2Fs10588-006-7084-x; and the bridging algorithm by Valente and Fujimoto (2010) https://doi.org/10.1016%2Fj.socnet.2010.03.003. On Unix systems, the betweenness, Key Players, and bridging implementations are parallelized with OpenMP, which may run faster on systems which have OpenMP configured.

Last 30 days

Last 365 days

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.