birankr: Ranking Nodes in Bipartite and Weighted Networks

Highly efficient functions for estimating various rank (centrality) measures of nodes in bipartite graphs (two-mode networks). Includes methods for estimating HITS, CoHITS, BGRM, and BiRank with implementation primarily inspired by He et al. (2016) <doi:10.1109/TKDE.2016.2611584>. Also provides easy-to-use tools for efficiently estimating PageRank in one-mode graphs, incorporating or removing edge-weights during rank estimation, projecting two-mode graphs to one-mode, and for converting edgelists and matrices to sparseMatrix format. Best of all, the package's rank estimators can work directly with common formats of network data including edgelists (class data.frame, data.table, or tbl_df) and adjacency matrices (class matrix or dgCMatrix).

Version: 1.0.1
Depends: R (≥ 3.4.0), Matrix, data.table
Suggests: testthat
Published: 2020-03-23
DOI: 10.32614/CRAN.package.birankr
Author: Brian Aronson [aut, cre], Kai-Cheng Yang [aut]
Maintainer: Brian Aronson <bdaronson at>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: README
CRAN checks: birankr results


Reference manual: birankr.pdf


Package source: birankr_1.0.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): birankr_1.0.1.tgz, r-oldrel (arm64): birankr_1.0.1.tgz, r-release (x86_64): birankr_1.0.1.tgz, r-oldrel (x86_64): birankr_1.0.1.tgz
Old sources: birankr archive


Please use the canonical form to link to this page.