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>.
Version: 1.2.4 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 Published: 2025-02-05 DOI: 10.32614/CRAN.package.netrankr Author: David Schoch [aut, cre], Julian Müller [ctb] Maintainer: David Schoch <david at schochastics.net> BugReports: https://github.com/schochastics/netrankr/issues License: MIT + file LICENSE URL: https://github.com/schochastics/netrankr/, https://schochastics.github.io/netrankr/ NeedsCompilation: yes Citation: netrankr citation info Materials: README, NEWS In views: NetworkAnalysis CRAN checks: netrankr results Documentation: Reference manual: netrankr.html , netrankr.pdf Vignettes: 09 benchmarks (source, R code)Please use the canonical form https://CRAN.R-project.org/package=netrankr to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4