netrankr

Implements methods for centrality related analyses of networks. While the package includes the possibility to build more than 20 indices, its main focus lies on index-free assessment of centrality via partial rankings obtained by neighborhood-inclusion or positional dominance. These partial rankings can be analyzed with different methods, including probabilistic methods like computing expected node ranks and relative rank probabilities (how likely is it that a node is more central than another?). The methodology is described in depth in the vignettes and in Schoch (2018) doi:10.1016/j.socnet.2017.12.003.

Last 30 days

This package has been downloaded 1,262 times in the last 30 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 58 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 15,312 times in the last 365 days. That's enough downloads to make it mildly famous in niche technical communities. A badge of honor! The day with the most downloads was Feb 05, 2025 with 204 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.