Question

(9) (Application: Google PageRank) Consider the graph Г below. 0 U3 04 02 (a) Just by looking at the graph, rank the nodes from most important to least important? Explain your reasoning in a complete sentence or two. (b) What is A, the incidence matrix of「 (c) By the Perron Frobenius Theorem, A has a unique largest eigenvalue. Use our iterative methods to approximate an eigenvector for the maximal eigenvalue. Use GeoGebra Give each entry of the eigenvector correct to 4 decimal (d) Use the Simple Google PageRank (SGPR) to rank the vertices of 1. (e) How do your SGPR results compare to you visual ranking from part (a)? I encourage you to play around with other graphs, make a visual ranking, and then (with the help of you calculator) compute the SGPR and compare. I find this fun.)

Answer 1

"Given that the graph is (A) From the visualization of the above figure Ranking from the most important to least important v_3 > v_4 greaterthanorequalto v_1 > v_4 as the v_3 rate connected to all. V_2 & v_1 are connected to 3 nodes inclusive v_4 is connected to only one mode b) By the: ""The most linked website has more rank"" so, v_3 > v_1 greaterthanorequalto v_1 > v_1 Both the result are similar"