A Complex Number-Based Node Ranking Calculation

Abstract

Google PageRank is widely used by search engines and known for its high calculation cost. This study proposes the usage of complex numbers in node ranking calculations for a network. The node scores are calculated in the graph using the Hermitian adjacency matrix and the complex plane through an algorithm, called HermitianStatus. The result of the proposed method is then compared to that of Google PageRank. In conclusion, HermitianStatus has advantages over PageRank.