influenceR
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 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.
- Version0.1.5
- R version≥ 3.2.0
- LicenseGPL-2
- Needs compilation?Yes
- Last release05/18/2023
Documentation
Team
Aditya Khanna
Simon Jacobs
Show author detailsRolesAuthorKamesh Madduri
Show author detailsRolesContributorDavid Bader
Show author detailsRolesContributor
Insights
Last 30 days
This package has been downloaded 1,549 times in the last 30 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 52 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 24,839 times in the last 365 days. The downloads are officially high enough to crash an underfunded departmental server. Quite an accomplishment! The day with the most downloads was Apr 30, 2024 with 170 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports2 packages
- Suggests1 package
- Reverse Suggests1 package