question archive The function pagerank (U, G) computes PageRanks by solving a sparse linear system
The function pagerank (U, G) computes PageRanks by solving a sparse linear system
Subject:MathPrice: Bought3
The function pagerank (U, G) computes PageRanks by solving a sparse linear system. It then plots a bar graph and prints the dominant URLs. (a) Create pagerank1(G) by modifying pagerank so that it just computes the PageBanks, but does not do any plotting or printing. (10) Create pagerank2(G) by modifying pagerankl to use inverse iteration instead of solving the sparse linear system. The key statements are x = (I - A)\e x = x/sum(x) What should be done in the unlikely event that the backslash operation in- volves a division by zero? (c) Create pagerank3(G) by modifying pageranki to use the power method instead of solving the sparse linear system. The key statements are G = p*G*D z = ((1-p)*(c"=0) + (c==0))/n; while termination_test x = CH: + e*(z*x) end What is an appropriate test for terminating the power iteration? (d) Use your functions to compute the PageRanks of the six-node example discussed in the text. Make sure you get the correct result from each of your three functions.
