Question: Part (e) Consider the Google PageRank algorithm as described on pages 10 and 11 in the class notes. The web consists of pages numbered 1,2,

Part (e) Consider the Google PageRank algorithm
Part (e) Consider the Google PageRank algorithm as described on pages 10 and 11 in the class notes. The web consists of pages numbered 1,2, . . . , N and it is described by N x N matrix G such that GU, 2') : 1 if there exists a link from page 3' to page j, and C(j, 21) : 0 otherwise. Assuming that following each link from a given page is equally likely, consider the corresponding matrix A of transition probabilities as decsribed in the notes, and consider the model with damping factor 37 (page 11 of the notes). In the downloaded le a5.mat you will nd a matrix G'. Assuming that p : 0.2, determine the fraction of time that the web browser will spend on each page in the long term. Determine which page is visited most frequently, and which page is visited least frequently, and the fractions of time spent on these two pages. Use the appropriate way of calling the functions max and min

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!