CRAN/E | netrankr

netrankr

Analyzing Partial Rankings in Networks

Installation

About

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.

Citation netrankr citation info
github.com/schochastics/netrankr/
schochastics.github.io/netrankr/
Bug report File report

Key Metrics

Version 1.2.3
R ≥ 3.0.1
Published 2023-12-19 298 days ago
Needs compilation? yes
License MIT
License File
CRAN checks netrankr results

Downloads

Yesterday 53 0%
Last 7 days 200 -39%
Last 30 days 1.153 +9%
Last 90 days 3.693 -7%
Last 365 days 22.089 +7%

Maintainer

Maintainer

David Schoch

Authors

David Schoch

aut / cre

Julian Müller

ctb

Material

README
NEWS
Reference manual
Package source

Vignettes

09 benchmarks
05 centrality indices
04 indirect relations in networks
01 neighborhood-inclusion and centrality
06 partial centrality
03 positional dominance in networks
07 probabilistic centrality
02 uniquely ranked graphs
08 use case

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

netrankr archive

Depends

R ≥ 3.0.1

Imports

igraph ≥ 1.0.1
Rcpp ≥ 0.12.8
Matrix

Suggests

knitr
rmarkdown
magrittr
testthat
shiny ≥ 0.13
miniUI ≥ 0.1.1
rstudioapi ≥ 0.5
covr

LinkingTo

Rcpp
RcppArmadillo

Reverse Depends

parsec

Reverse Suggests

tidygraph