**This is an old revision of the document!** ----
====== Math 445 Lab 6: Google Page Rank ====== **Part 1:** **(a)** The following directed graph represents links between eight webpages: {{:gibson:teaching:fall-2012:math445:network1.png?direct&400|}} Give the Page Rank of each page, and provide a list of the page indices sorted by their Page Ranks. You can refer to class notes or [[http://www.ams.org/samplings/feature-column/fcarc-pagerank]] for details of the Google Page Rank algorithm. Hints * It's good to have a firm grasp on the mathematics before writing the code. * Write your code in a script file and run the script from within Matlab. * Use ''G = zeros(8,8)'' to allocate an 8 x 8 matrix of zeros, and then insert 1s at the required spots with statements like ''G(3,4) = 1''. * Better yet, store the set of nonzero indices as a ''N x 2'' matrix in a file ''links.asc'', then load that matrix into Matlab with ''L = load links.asc'', and then loop over the ''N'' rows of ''L'' and assign ones into the specified elements of ''G'' with ''G(L(n,2), L(n,1)) = 1'' where ''n'' is the loop index. **(b)** Suppose that, instead of representing links between web pages, the directed graphs tell who likes whom among a your circle of friends, and that you use the same algorithm to compute a Likeability Rank, with the same numerical results. Would this give true quantitative values and rankings of how likeable your friends are? Why or why not? What does your answer here say about Google Page Rank as a method of ranking web pages? I don't have a specific answer in mind here. Just be thoughtful. **Part 2:** will focus on a few modifications of the Page Rank algorithm and apply the modified algorithm to a large network of webpages.
