Consider the graph (Figure 5.20) with 7 pages (A, B, C, D, E, F and G) where: A → B B → A, C, D, E C → A, E D → C E → G F → E, G G → A, F Figure 5.20 Assume that the PageRank values for any page m at...

Consider the graph (Figure 5.20) with 7 pages (A, B, C, D, E, F and G) where:

A → B

B → A, C, D, E

C → A, E

D → C

E → G

F → E, G

G → A, F

Figure 5.20

Assume that the PageRank values for any page m at iteration 0 is P R(m) = 1 and that the damping factor for iterations is d = 0.85. An additional page H is added to the graph, where the page has a single outlink to one (and only one) of the previous existing pages. The PageRank values for this new graph on iteration 2 are the following.

P R(A) = 1.4834375 P R(B) = 1.180625

P R(C) = 1.393125

P R(D) = 0.49

P R(E) = 1.1221875

P R(F) = 0.755625

P R(G) = 1.425

P R(H) = 0.15

(a) Determine to what page H outlinks.

(b) Would the change in the graph dramatically affect the PageRank values for every node if more iterations are performed? Why/Why not? Justify?