Alert button
Picture for Suvarna Saumya Chandrashekhar

Suvarna Saumya Chandrashekhar

Alert button

PageRank Algorithm using Eigenvector Centrality -- New Approach

Add code
Bookmark button
Alert button
Jan 21, 2022
Suvarna Saumya Chandrashekhar, Mashrin Srivastava, B. Jaganathan, Pankaj Shukla

Figure 1 for PageRank Algorithm using Eigenvector Centrality -- New Approach
Figure 2 for PageRank Algorithm using Eigenvector Centrality -- New Approach
Figure 3 for PageRank Algorithm using Eigenvector Centrality -- New Approach
Figure 4 for PageRank Algorithm using Eigenvector Centrality -- New Approach

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.

Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon