Yang et al., "BiRank: Fast and Flexible Ranking on Bipartite Networks with R and Python" (2020)

Kai-Cheng Yang, Brian Aronson, and Yong-Yeol Ahn, Journal of Open Source Software 5(51), 2315 (2020)
Link | PDF | Code

@article{yang2020birank,
    author = {Kai-Cheng Yang and Brian Aronson and Yong-Yeol Ahn},
    title = {BiRank: Fast and Flexible Ranking on Bipartite Networks with R and Python},
    journal = {Journal of Open Source Software},
    volume = {5},
    number = {51},
    pages = {2315},
    doi = {10.21105/joss.02315},
    year = {2020},
}

Provides R and Python implementations of PageRank-like algorithms that rank both node types directly in a bipartite network. This avoids the structural information loss introduced by one-mode projection and includes HITS, CoHITS, BGRM, and BiRank variants.

Bipartite network, PageRank, Network centrality