effective solving the one-two gap problem in the pagerank algorithm

One of the criteria for search engines to determine the popularity of pages is an analysis of links in the web graph, and various methods have already been presented in this regard. the pagerank algorithm is the oldest web page ranking methods based on web graph and is still used as one of the important factors of web pages on google. since the invention of this method, several bugs have been published and solutions have been proposed to correct them. the most important problem that is most noticed is pages without an out link or so-called suspended pages. in web graph analysis, we noticed another problem that occurs on some pages at the out degree of one, and the problem is that under conditions, the linked page score is more than the home page. this problem can generate unrealistic scores for pages, and the link chain can invalidate the web graph. in this paper, this problem has been investigated under the title one-two gap, and a solution has been proposed to it. experimental results show that fixing of the one-two gap problem using the proposed solution. test standard benchmark dataset, trec2003, is applied to evaluate the proposed method. the experimental results show that our proposed method outperforms pagerank method theoretically and experimentally in the term of precision, accuracy, and sensitivity with such criteria as pd, p@n, ndcg@n, map, and recall.