netrankr: Analyzing Partial Rankings in Networks
Version 0.2.0

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) .

Package details

AuthorDavid Schoch [aut, cre], Julian Müller [ctb]
Date of publication2018-01-08 15:38:47 UTC
MaintainerDavid Schoch <[email protected]>
LicenseMIT + file LICENSE
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the netrankr package in your browser

Any scripts or data that you put into this service are public.

netrankr documentation built on Jan. 8, 2018, 5:03 p.m.