Investigating bias in the page ranking approach

This paper investigates the random walk within the PageRank¹ algorithm used by Google and other search engines. It begins by explaining how the Random Walk works with the Markov Chain. Based upon this, the paper then presents how specific locations on the matrix form graph cycles. These cycles are capable of controlling pagerank queues and moves these rank value from one online webpage to the next. Results indicate that the adjacency matrix used as a basis for PageRank may have biased spaces that need to be taken into consideration.