Analyzing Partial Rankings in Networks R package netrankr version 1.2.4 CRAN Task View: NetworkAnalysis (https://CRAN.R-project.org/view=NetworkAnalysis) 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>. Software Depends: R (>= 3.0.1) Imports: igraph (>= 1.0.1), Rcpp (>= 0.12.8), Matrix LinkingTo: Rcpp,RcppArmadillo Suggests: knitr, rmarkdown, magrittr, testthat, shiny (>= 0.13), miniUI (>= 0.1.1), rstudioapi (>= 0.5), covr David Schoch <david@schochastics.net> Comprehensive R Archive Network (CRAN) David Schoch [aut, cre] (ORCID: <https://orcid.org/0000-0003-2952-4812>), Julian Müller [ctb] MIT + file LICENSE (https://CRAN.R-project.org/package=netrankr/LICENSE) 2025-02-05 application/tgz https://CRAN.R-project.org/package=netrankr doi:10.32614/CRAN.package.netrankr