# PageRank Algorithm using Eigenvector Centrality -- New Approach

arXiv: https://arxiv.org/abs/2201.05469 · HTML: https://mlsanity.com/paper/2201.05469/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jan 2022.

## Built on by (most cited first, 2 of 2)

- [Hubs or Fringes: Pretraining Data Selection via Web Graph Centrality](https://mlsanity.com/paper/2606.11499/) (2026)
- [Measuring Research Convergence in Interdisciplinary Teams Using Large Language Models and Graph Analytics](https://mlsanity.com/paper/2603.20204/) (2026)

## Abstract (arXiv)

The purpose of the research is to find a centrality measure that can be used in place of PageRank and to find out the conditions where we can use it in place of PageRank. After analysis and comparison of graphs with a large number of nodes using Spearman's Rank Coefficient Correlation, the conclusion is evident that Eigenvector can be safely used in place of PageRank in directed networks to improve the performance in terms of the time complexity.