a. Consider the directed graph G=(V,E) with V={1,2,3,4,5) and E={(1,2), (1,3), (2,1),(2,3), (3,4),(3,5),(4,5),(5,4)} Assume that the...

Transcribed Image Text:

a. Consider the directed graph G=(V,E) with V={1,2,3,4,5) and E={(1,2), (1,3), (2,1),(2,3), (3,4),(3,5),(4,5),(5,4)} Assume that the probability of teleport (1-B) is 0.2 compute their page rank after 3rd Iteration b. We focus on two web pages A and B, with no hyperlink from A to B. (There are many other web pages of course.) Let Old(B) be the pagerank of B. We now add a hyperlink from A to B. After the addition of new hyperlink, the new pagerank of B, New(B), should always be higher than Old (B). Is the statement true? Justify. a. Consider the directed graph G=(V,E) with V={1,2,3,4,5) and E={(1,2), (1,3), (2,1),(2,3), (3,4),(3,5),(4,5),(5,4)} Assume that the probability of teleport (1-B) is 0.2 compute their page rank after 3rd Iteration b. We focus on two web pages A and B, with no hyperlink from A to B. (There are many other web pages of course.) Let Old(B) be the pagerank of B. We now add a hyperlink from A to B. After the addition of new hyperlink, the new pagerank of B, New(B), should always be higher than Old (B). Is the statement true? Justify.

Answer rating: 100% (QA)

Salution 102 Given that the di... View the full answer