A-> B,C
A-> A,D,E,F
C->AF
Assume that the PageRank values for any page m at iteration 0 is PR(m)=1 and teleportation factor for iterations is $\beta$=0.85.Perform the page rank algorithm and determine the rank for every page at iteration 2.

Transition Matrix

• From the graph it is clear that D, E and F are dead ends.

• Before applying page rank algorithm remove dead ends.

• The new graph will be:

so new transition matrix will be

$\beta = 0.85$ and initial page rank vector

Iteration 1:

$V = \beta m v + (1 - \beta) e/n$

Iteration 2

$V = \beta m v + ( 1 - \beta) e/n$

After Iteration 2 page rank of

Page A = 343/400

B = 127/160

C = 127/160

D = $\frac{PR(B)}{2} =\frac{127/160}{2} = \frac{127}{320}$

E = $\frac{PR(B)}{2} = \frac{127}{320}$

F = $\frac{PR(B)}{2} + \frac{PR(B)}{2} = \frac{127}{320} + \frac{127}{320}$

= $\frac{254}{320}$