Question

Figure 5.10: A tree of dead ends

Compute PageRank from the web graph image posted keeping in mind it features a series of deadends. .

There is a single node with a self-loop, which is also the root of a complete binary tree of n levels.

Suppose we recursively eliminate dead ends from the graph, solve the remaining graph, estimating the PageRank for the dead-end pages. What would be the Page- Rank assigned to each of the nodes?

Answer 1

1. Suppose V is a vector whose ith component is the probability that each random walker is at page i at certain time.
2. If each walker follows a link from i at random, the probability distribution for walkers is then given by vector Mv.
3. Pages are important in proportion to how likely a walker is to be there.

Below screenshots are useful to find the page rank including the dead end pages. This algorithm is useful to find page rank.