netrankr
swMATH43401CRANnetrankrMaRDI QIDQ1350993
Analyzing Partial Rankings in Networks
Last update: 19 December 2023
Copyright license: MIT license, File License
Software version identifier: 1.2.0, 0.2.0, 0.2.1, 0.3.0, 1.0.0, 1.1.0, 1.1.1, 1.2.1, 1.2.2, 1.2.3
Source code repository: https://github.com/cran/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>.
Related Items (1)
This page was built for software: netrankr
