Exploring The Relationship Between Ordinary PageRank, Lazy PageRank and Random Walk with Backstep PageRank for Different Graph Structures

• PageRank is an algorithm for ranking web pages. It is the first and best known webgraph-based algorithm in the Google search engine. The algorithm is simple, robust and reliable to measure the importance of web pages. This chapter presents a comparative review of three variants of PageRank, namely ordinary PageRank (introduced by Brin and Page as a measure of importance of a web page), lazy PageRank and random walk with backstep PageRank. It compares the variants in terms of their convergence and consistency in rank scores for different graph structures with reference to PageRank’s parameters, damping factor and backstep parameter. The chapter also shows that ordinary PageRank can be formulated from the other two variants by some proportionality relationships.

Ämnesord

NATURVETENSKAP  -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Probability Theory and Statistics (hsv//eng)

Nyckelord

backstep parameter

graph structure

lazy PageRank

ordinary PageRank

random walk PageRank

web page

Mathematics/Applied Mathematics

matematik/tillämpad matematik

Publikations- och innehållstyp

ref (ämneskategori)

kap (ämneskategori)